java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:34:16,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:34:16,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:34:16,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:34:16,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:34:16,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:34:16,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:34:16,776 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:34:16,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:34:16,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:34:16,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:34:16,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:34:16,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:34:16,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:34:16,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:34:16,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:34:16,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:34:16,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:34:16,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:34:16,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:34:16,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:34:16,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:34:16,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:34:16,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:34:16,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:34:16,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:34:16,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:34:16,792 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:34:16,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:34:16,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:34:16,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:34:16,793 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:34:16,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:34:16,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:34:16,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:34:16,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:34:16,805 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:34:16,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:34:16,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:34:16,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:34:16,806 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:34:16,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:34:16,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:34:16,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:34:16,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:34:16,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:34:16,846 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:34:16,849 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:34:16,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:34:16,850 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:34:16,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-02 10:34:17,005 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:34:17,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:34:17,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:34:17,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:34:17,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:34:17,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:34:16" (1/1) ... [2018-02-02 10:34:17,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbd5d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17, skipping insertion in model container [2018-02-02 10:34:17,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:34:16" (1/1) ... [2018-02-02 10:34:17,024 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:34:17,054 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:34:17,151 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:34:17,168 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:34:17,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17 WrapperNode [2018-02-02 10:34:17,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:34:17,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:34:17,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:34:17,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:34:17,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... [2018-02-02 10:34:17,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:34:17,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:34:17,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:34:17,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:34:17,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:34:17,240 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:34:17,240 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:34:17,240 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:34:17,240 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:34:17,240 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:34:17,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:34:17,634 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:34:17,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:34:17 BoogieIcfgContainer [2018-02-02 10:34:17,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:34:17,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:34:17,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:34:17,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:34:17,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:34:16" (1/3) ... [2018-02-02 10:34:17,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5813f3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:34:17, skipping insertion in model container [2018-02-02 10:34:17,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:34:17" (2/3) ... [2018-02-02 10:34:17,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5813f3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:34:17, skipping insertion in model container [2018-02-02 10:34:17,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:34:17" (3/3) ... [2018-02-02 10:34:17,641 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-02-02 10:34:17,648 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:34:17,654 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-02-02 10:34:17,686 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:34:17,687 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:34:17,687 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:34:17,687 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:34:17,687 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:34:17,687 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:34:17,687 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:34:17,687 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:34:17,688 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:34:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-02-02 10:34:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:34:17,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:17,710 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:17,710 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:17,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1658030564, now seen corresponding path program 1 times [2018-02-02 10:34:17,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:17,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:17,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:17,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:34:17,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:17,848 INFO L182 omatonBuilderFactory]: Interpolants [138#true, 139#false, 140#(= 1 (select |#valid| |main_#t~malloc0.base|)), 141#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:34:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:17,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:34:17,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:34:17,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:34:17,859 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-02-02 10:34:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:18,111 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions. [2018-02-02 10:34:18,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:18,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:34:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:18,120 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:34:18,120 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:34:18,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:34:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2018-02-02 10:34:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:34:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-02-02 10:34:18,151 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 8 [2018-02-02 10:34:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:18,152 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-02-02 10:34:18,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:34:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-02-02 10:34:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:34:18,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:18,152 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:18,153 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1658030565, now seen corresponding path program 1 times [2018-02-02 10:34:18,154 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:18,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:18,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:34:18,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,215 INFO L182 omatonBuilderFactory]: Interpolants [419#true, 420#false, 421#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 422#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 12))] [2018-02-02 10:34:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:34:18,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:34:18,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:34:18,217 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 4 states. [2018-02-02 10:34:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:18,336 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-02 10:34:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:34:18,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:34:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:18,338 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:34:18,338 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:34:18,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:34:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2018-02-02 10:34:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 10:34:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-02-02 10:34:18,349 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 8 [2018-02-02 10:34:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:18,349 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-02-02 10:34:18,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:34:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-02-02 10:34:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:34:18,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:18,350 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:18,350 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:18,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1172213647, now seen corresponding path program 1 times [2018-02-02 10:34:18,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:18,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:18,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:34:18,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,436 INFO L182 omatonBuilderFactory]: Interpolants [697#true, 698#false, 699#(= (select |#valid| main_~list~0.base) 1), 700#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:34:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:34:18,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:34:18,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:34:18,437 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 4 states. [2018-02-02 10:34:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:18,582 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-02-02 10:34:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:18,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:34:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:18,583 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:34:18,583 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:34:18,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:34:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2018-02-02 10:34:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:34:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 10:34:18,590 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 16 [2018-02-02 10:34:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:18,591 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 10:34:18,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:34:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 10:34:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:34:18,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:18,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:18,592 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:18,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1172213646, now seen corresponding path program 1 times [2018-02-02 10:34:18,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:18,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:18,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:34:18,695 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,696 INFO L182 omatonBuilderFactory]: Interpolants [967#true, 968#false, 969#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 970#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base))), 971#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 12 (select |#length| main_~list~0.base))), 972#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base))), 973#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:34:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:18,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:34:18,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:34:18,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:18,697 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 7 states. [2018-02-02 10:34:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:18,954 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2018-02-02 10:34:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:34:18,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 10:34:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:18,956 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:34:18,956 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:34:18,956 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 10:34:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:34:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2018-02-02 10:34:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:34:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2018-02-02 10:34:18,960 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 16 [2018-02-02 10:34:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:18,961 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2018-02-02 10:34:18,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:34:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2018-02-02 10:34:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:34:18,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:18,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:18,961 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1215883307, now seen corresponding path program 1 times [2018-02-02 10:34:18,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:18,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:19,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:34:19,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,030 INFO L182 omatonBuilderFactory]: Interpolants [1283#true, 1284#false, 1285#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1286#(and (= 12 (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))), 1287#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:34:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:19,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:19,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:19,031 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand 5 states. [2018-02-02 10:34:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:19,198 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-02-02 10:34:19,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:34:19,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:34:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:19,199 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:34:19,199 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:34:19,200 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 10:34:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:34:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 138. [2018-02-02 10:34:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:34:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-02-02 10:34:19,205 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 18 [2018-02-02 10:34:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:19,206 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-02-02 10:34:19,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-02-02 10:34:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:34:19,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:19,206 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:19,207 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1215883308, now seen corresponding path program 1 times [2018-02-02 10:34:19,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:19,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:19,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:34:19,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,259 INFO L182 omatonBuilderFactory]: Interpolants [1648#true, 1649#false, 1650#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1651#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1652#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 10:34:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:19,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:19,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:19,260 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 5 states. [2018-02-02 10:34:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:19,372 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2018-02-02 10:34:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:19,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:34:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:19,373 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:34:19,374 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:34:19,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:34:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2018-02-02 10:34:19,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:34:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-02-02 10:34:19,378 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 18 [2018-02-02 10:34:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:19,378 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-02-02 10:34:19,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-02-02 10:34:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:34:19,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:19,379 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:19,379 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -338658602, now seen corresponding path program 1 times [2018-02-02 10:34:19,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:19,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:19,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:34:19,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,466 INFO L182 omatonBuilderFactory]: Interpolants [1986#true, 1987#false, 1988#(= (select |#valid| main_~list~0.base) 1), 1989#(= (select |#valid| main_~end~0.base) 1), 1990#(and (not (= main_~end~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 1991#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 1992#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 1993#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1994#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 10:34:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:34:19,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:34:19,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:19,467 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 9 states. [2018-02-02 10:34:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:19,716 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-02 10:34:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:34:19,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:34:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:19,717 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:34:19,717 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:34:19,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:34:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136. [2018-02-02 10:34:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 10:34:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-02-02 10:34:19,721 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-02-02 10:34:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:19,721 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-02-02 10:34:19,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:34:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-02-02 10:34:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:34:19,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:19,722 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:19,722 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -338658601, now seen corresponding path program 1 times [2018-02-02 10:34:19,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:19,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:19,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:34:19,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,864 INFO L182 omatonBuilderFactory]: Interpolants [2292#true, 2293#false, 2294#(= (select |#valid| main_~list~0.base) 1), 2295#(= (select |#valid| main_~end~0.base) 1), 2296#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 2297#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (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))), 2298#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 2299#(and (= 12 (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))), 2300#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 2301#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:34:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:19,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:34:19,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:34:19,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:34:19,865 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 10 states. [2018-02-02 10:34:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:20,339 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-02-02 10:34:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:34:20,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:34:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:20,341 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:34:20,341 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:34:20,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:34:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:34:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2018-02-02 10:34:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:34:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2018-02-02 10:34:20,345 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 22 [2018-02-02 10:34:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:20,346 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2018-02-02 10:34:20,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:34:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2018-02-02 10:34:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:34:20,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:20,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] [2018-02-02 10:34:20,347 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 877684228, now seen corresponding path program 1 times [2018-02-02 10:34:20,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:20,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:20,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:34:20,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,381 INFO L182 omatonBuilderFactory]: Interpolants [2610#true, 2611#false, 2612#(not (= 0 |main_#t~malloc0.base|)), 2613#(not (= 0 main_~list~0.base)), 2614#(not (= 0 main_~end~0.base))] [2018-02-02 10:34:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:20,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:20,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:20,382 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 5 states. [2018-02-02 10:34:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:20,462 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2018-02-02 10:34:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:20,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 10:34:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:20,463 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:34:20,463 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:34:20,463 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 10:34:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:34:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-02-02 10:34:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:34:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-02-02 10:34:20,465 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 28 [2018-02-02 10:34:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:20,465 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-02-02 10:34:20,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-02-02 10:34:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:34:20,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:20,466 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:20,467 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:20,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1451762849, now seen corresponding path program 1 times [2018-02-02 10:34:20,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:20,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:20,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:34:20,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,549 INFO L182 omatonBuilderFactory]: Interpolants [2897#true, 2898#false, 2899#(= |main_#t~mem21| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 2900#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 2901#(= ~unnamed0~BLACK |main_#t~mem22|)] [2018-02-02 10:34:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:20,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:20,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:20,549 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 5 states. [2018-02-02 10:34:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:20,634 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-02-02 10:34:20,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:20,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:34:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:20,635 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:34:20,635 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:34:20,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:34:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:34:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2018-02-02 10:34:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:34:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 10:34:20,638 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 29 [2018-02-02 10:34:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:20,638 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 10:34:20,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 10:34:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:34:20,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:20,639 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:20,639 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:20,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1220341734, now seen corresponding path program 1 times [2018-02-02 10:34:20,641 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:20,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:20,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:34:20,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,673 INFO L182 omatonBuilderFactory]: Interpolants [3171#true, 3172#false, 3173#(= 1 (select |#valid| |main_#t~malloc14.base|)), 3174#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3175#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:34:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:20,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:20,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:20,673 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 5 states. [2018-02-02 10:34:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:20,854 INFO L93 Difference]: Finished difference Result 195 states and 209 transitions. [2018-02-02 10:34:20,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:34:20,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:34:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:20,855 INFO L225 Difference]: With dead ends: 195 [2018-02-02 10:34:20,855 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:34:20,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:34:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 128. [2018-02-02 10:34:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:34:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-02 10:34:20,859 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 29 [2018-02-02 10:34:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:20,859 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-02 10:34:20,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-02 10:34:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:34:20,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:20,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:20,860 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1220341733, now seen corresponding path program 1 times [2018-02-02 10:34:20,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:20,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:20,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:34:20,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,927 INFO L182 omatonBuilderFactory]: Interpolants [3504#false, 3505#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 3506#(and (= 12 (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))), 3507#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12)), 3503#true] [2018-02-02 10:34:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:20,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:20,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:20,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:20,928 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-02-02 10:34:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:21,110 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-02-02 10:34:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:34:21,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:34:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:21,111 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:34:21,111 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:34:21,112 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 10:34:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:34:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 127. [2018-02-02 10:34:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:34:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-02-02 10:34:21,114 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 29 [2018-02-02 10:34:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:21,115 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-02-02 10:34:21,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-02-02 10:34:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:34:21,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:21,116 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] [2018-02-02 10:34:21,116 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1085863836, now seen corresponding path program 1 times [2018-02-02 10:34:21,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:21,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:21,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:34:21,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,194 INFO L182 omatonBuilderFactory]: Interpolants [3861#true, 3862#false, 3863#(= 1 (select |#valid| main_~end~0.base)), 3864#(and (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 1 (select |#valid| |main_#t~malloc14.base|))), 3865#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 3866#(and (not (= main_~end~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)))), 3867#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3868#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:34:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:34:21,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:34:21,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:34:21,195 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 8 states. [2018-02-02 10:34:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:21,452 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-02-02 10:34:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:34:21,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 10:34:21,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:21,485 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:34:21,485 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:34:21,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:34:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:34:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2018-02-02 10:34:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:34:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-02 10:34:21,487 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 33 [2018-02-02 10:34:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:21,487 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-02 10:34:21,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:34:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-02 10:34:21,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:34:21,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:21,488 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] [2018-02-02 10:34:21,488 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:21,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1085863837, now seen corresponding path program 1 times [2018-02-02 10:34:21,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:21,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:21,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:34:21,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,612 INFO L182 omatonBuilderFactory]: Interpolants [4144#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base))), 4136#true, 4137#false, 4138#(= 1 (select |#valid| main_~end~0.base)), 4139#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 4140#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (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))), 4141#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 4142#(and (= 12 (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))), 4143#(and (= 12 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|))] [2018-02-02 10:34:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:34:21,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:34:21,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:21,612 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 9 states. [2018-02-02 10:34:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:21,919 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-02 10:34:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:34:21,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 10:34:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:21,920 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:34:21,920 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:34:21,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:34:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2018-02-02 10:34:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:34:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-02-02 10:34:21,922 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 33 [2018-02-02 10:34:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:21,922 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-02-02 10:34:21,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:34:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-02-02 10:34:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:34:21,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:21,923 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] [2018-02-02 10:34:21,923 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash -499110813, now seen corresponding path program 1 times [2018-02-02 10:34:21,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:21,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:21,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:34:21,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,983 INFO L182 omatonBuilderFactory]: Interpolants [4400#(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))), 4401#(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))), 4402#(and (= |main_#t~mem25.base| 0) (= 0 |main_#t~mem25.offset|)), 4398#true, 4399#false] [2018-02-02 10:34:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:21,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:34:21,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:34:21,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:34:21,984 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 5 states. [2018-02-02 10:34:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:22,066 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-02-02 10:34:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:34:22,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:34:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:22,067 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:34:22,067 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:34:22,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:34:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:34:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-02 10:34:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:34:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-02-02 10:34:22,069 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 35 [2018-02-02 10:34:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:22,070 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-02-02 10:34:22,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:34:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-02-02 10:34:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:34:22,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:22,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:22,071 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash 413563347, now seen corresponding path program 1 times [2018-02-02 10:34:22,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:22,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:22,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:22,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:34:22,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:22,385 INFO L182 omatonBuilderFactory]: Interpolants [4654#true, 4655#false, 4656#(= |main_#t~malloc0.offset| 0), 4657#(= main_~list~0.offset 0), 4658#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 4659#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4660#(and (= 0 |main_#t~malloc5.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= main_~list~0.offset |main_#t~malloc5.offset|)), 4661#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4662#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 4663#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4664#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset |main_#t~mem9.offset|)), 4665#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 4666#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 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)))), 4667#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (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)))), 4668#(or (and (<= 12 (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))) (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)))), 4669#(or (and (= 0 |main_#t~mem26.base|) (= 0 |main_#t~mem26.offset|)) (and (<= 12 (select |#length| |main_#t~mem26.base|)) (= 0 |main_#t~mem26.offset|))), 4670#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base)))), 4671#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base)))] [2018-02-02 10:34:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:22,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:34:22,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:34:22,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:34:22,386 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 18 states. [2018-02-02 10:34:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:23,377 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2018-02-02 10:34:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:34:23,377 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-02 10:34:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:23,378 INFO L225 Difference]: With dead ends: 224 [2018-02-02 10:34:23,378 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 10:34:23,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:34:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 10:34:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-02-02 10:34:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:34:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-02-02 10:34:23,382 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 49 [2018-02-02 10:34:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:23,383 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-02-02 10:34:23,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:34:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-02-02 10:34:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:34:23,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:23,384 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:23,384 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 413563346, now seen corresponding path program 1 times [2018-02-02 10:34:23,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:23,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:23,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:23,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:34:23,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:23,637 INFO L182 omatonBuilderFactory]: Interpolants [5094#true, 5095#false, 5096#(= |main_#t~malloc0.offset| 0), 5097#(= main_~list~0.offset 0), 5098#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 5099#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5100#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= main_~list~0.offset |main_#t~malloc5.offset|)), 5101#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5102#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 5103#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5104#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset |main_#t~mem9.offset|)), 5105#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 5106#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 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)))), 5107#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (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)))), 5108#(or (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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5109#(or (= 1 (select |#valid| |main_#t~mem26.base|)) (and (= 0 |main_#t~mem26.base|) (= 0 |main_#t~mem26.offset|))), 5110#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 5111#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:34:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:23,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:34:23,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:34:23,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:34:23,638 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 18 states. [2018-02-02 10:34:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:24,397 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2018-02-02 10:34:24,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:34:24,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-02 10:34:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:24,398 INFO L225 Difference]: With dead ends: 224 [2018-02-02 10:34:24,398 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 10:34:24,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:34:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 10:34:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-02-02 10:34:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:34:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-02-02 10:34:24,401 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 49 [2018-02-02 10:34:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:24,401 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-02-02 10:34:24,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:34:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-02-02 10:34:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:34:24,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:24,402 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:24,402 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:24,402 INFO L82 PathProgramCache]: Analyzing trace with hash 176207444, now seen corresponding path program 1 times [2018-02-02 10:34:24,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:24,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:25,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:25,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:34:25,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:25,015 INFO L182 omatonBuilderFactory]: Interpolants [5536#(and (= main_~list~0.offset 0) (= (select |#valid| 0) 0)), 5537#(and (= main_~list~0.offset 0) (= (select |#valid| 0) 0) (= (select |#valid| main_~list~0.base) 1)), 5538#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| 0) 0) (= (select |#valid| main_~end~0.base) 1)), 5539#(and (= main_~list~0.offset 0) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= (select |#valid| 0) 0) (= main_~list~0.offset |main_#t~malloc5.offset|)), 5540#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| 0) 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5541#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (= (select |#valid| 0) 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 5542#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| 0) 0) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5543#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset |main_#t~mem9.offset|) (= (select |#valid| 0) 0)), 5544#(and (= main_~list~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (or (and (not (= main_~end~0.base main_~list~0.base)) (or (and (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (< main_~end~0.offset (+ main_~list~0.offset 1))) (< main_~end~0.offset main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 5545#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1))))), 5546#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (or (and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 0)) (= (select |#valid| 0) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5547#(and (or (and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) 0))) (= 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))), 5548#(and (= 0 |main_#t~mem26.offset|) (or (= 0 |main_#t~mem26.base|) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem26.base|) 0)) (= 1 (select (select |#memory_int| |main_#t~mem26.base|) (+ 0 8))) (= (select |#valid| 0) 0)))), 5549#(and (or (= main_~end~0.base 0) (and (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))) (= main_~end~0.offset 0)), 5550#(or (<= (+ main_~end~0.offset 1) 0) (and (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))))), 5551#(or (<= (+ main_~end~0.offset 1) 0) (and (= 1 |main_#t~mem22|) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5552#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0))) (<= (+ main_~end~0.offset 1) 0)), 5553#(and (= 0 |main_#t~mem23.base|) (= 1 (select |#valid| 0))), 5554#(= 1 (select |#valid| main_~end~0.base)), 5532#true, 5533#false, 5534#(= (select |#valid| 0) 0), 5535#(and (= (select |#valid| 0) 0) (= |main_#t~malloc0.offset| 0))] [2018-02-02 10:34:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:25,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:34:25,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:34:25,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:34:25,016 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 23 states. [2018-02-02 10:34:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:26,581 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-02 10:34:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:34:26,581 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-02-02 10:34:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:26,582 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:34:26,582 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:34:26,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:34:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:34:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 149. [2018-02-02 10:34:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:34:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2018-02-02 10:34:26,585 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 53 [2018-02-02 10:34:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:26,585 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2018-02-02 10:34:26,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:34:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2018-02-02 10:34:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:34:26,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:26,585 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:26,586 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1013793731, now seen corresponding path program 1 times [2018-02-02 10:34:26,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:26,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:34:26,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:34:26,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:34:26,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:26,624 INFO L182 omatonBuilderFactory]: Interpolants [5968#(or (not (= |main_#t~mem26.base| 0)) (not (= 0 |main_#t~mem26.offset|))), 5969#(or (not (= main_~end~0.base 0)) (not (= 0 main_~end~0.offset))), 5964#true, 5965#false, 5966#(and (= |main_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5967#(or (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))] [2018-02-02 10:34:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:34:26,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:34:26,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:34:26,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:34:26,625 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 6 states. [2018-02-02 10:34:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:26,753 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-02 10:34:26,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:34:26,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-02-02 10:34:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:26,754 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:34:26,754 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:34:26,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:34:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:34:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-02-02 10:34:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:34:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-02 10:34:26,757 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 56 [2018-02-02 10:34:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:26,757 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-02 10:34:26,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:34:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-02 10:34:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:34:26,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:26,758 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:26,758 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash 615131242, now seen corresponding path program 1 times [2018-02-02 10:34:26,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:26,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:27,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:27,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:34:27,192 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:27,193 INFO L182 omatonBuilderFactory]: Interpolants [6208#true, 6209#false, 6210#(= (select |#valid| main_~list~0.base) 1), 6211#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6212#(and (= 0 |main_#t~malloc5.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 6213#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6214#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 6215#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6216#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6217#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6218#(and (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= 12 (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 6219#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6220#(and (not (= main_~end~0.base |main_#t~mem16.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset))), 6221#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base))), 6222#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem18.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6223#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 6224#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6225#(and (= 12 (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))), 6226#(and (= 12 (select |#length| |main_#t~mem26.base|)) (= 0 |main_#t~mem26.offset|)), 6227#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-02-02 10:34:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:27,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:34:27,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:34:27,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:34:27,193 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 20 states. [2018-02-02 10:34:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:27,868 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2018-02-02 10:34:27,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:34:27,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 10:34:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:27,869 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:34:27,869 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:34:27,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:34:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:34:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 147. [2018-02-02 10:34:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:34:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-02 10:34:27,872 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 58 [2018-02-02 10:34:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:27,872 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-02 10:34:27,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:34:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-02 10:34:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:34:27,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:27,872 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:27,872 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash 615131241, now seen corresponding path program 1 times [2018-02-02 10:34:27,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:27,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:28,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:28,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:34:28,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:28,148 INFO L182 omatonBuilderFactory]: Interpolants [6602#true, 6603#false, 6604#(= (select |#valid| main_~list~0.base) 1), 6605#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6606#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|))), 6607#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6608#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 6609#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6610#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6611#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6612#(and (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 6613#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6614#(and (not (= main_~end~0.base |main_#t~mem16.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)))), 6615#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 6616#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem18.base|))), 6617#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 6618#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6620#(= 1 (select |#valid| |main_#t~mem26.base|)), 6621#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:34:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:28,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:34:28,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:34:28,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:34:28,148 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 20 states. [2018-02-02 10:34:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:28,770 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-02-02 10:34:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:34:28,770 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 10:34:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:28,771 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:34:28,771 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:34:28,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:34:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:34:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 147. [2018-02-02 10:34:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:34:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-02-02 10:34:28,774 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-02-02 10:34:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:28,774 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-02-02 10:34:28,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:34:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-02-02 10:34:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:34:28,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:28,775 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:28,775 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash 549678038, now seen corresponding path program 2 times [2018-02-02 10:34:28,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:28,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:28,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:28,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:34:28,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:28,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 10:34:28,987 INFO L182 omatonBuilderFactory]: Interpolants [7008#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.offset|)), 7009#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 7010#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 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)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7011#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7012#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7013#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem26.base|) |main_#t~mem26.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) |main_#t~mem26.offset|))), 7014#(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))), 7015#(and (= |main_#t~mem25.base| 0) (= 0 |main_#t~mem25.offset|)), 7001#true, 7002#false, 7003#(= (select |#valid| main_~list~0.base) 1), 7004#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7005#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|))), 7006#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7007#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|)))] [2018-02-02 10:34:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:28,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:34:28,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:34:28,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:34:28,987 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 15 states. [2018-02-02 10:34:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:29,374 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-02-02 10:34:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:34:29,376 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-02-02 10:34:29,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:29,377 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:34:29,377 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:34:29,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:34:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:34:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-02 10:34:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:34:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-02-02 10:34:29,380 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-02-02 10:34:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:29,380 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-02-02 10:34:29,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:34:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-02-02 10:34:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:34:29,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:29,381 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:29,381 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:29,381 INFO L82 PathProgramCache]: Analyzing trace with hash -112377493, now seen corresponding path program 1 times [2018-02-02 10:34:29,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:29,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:29,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:29,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:34:29,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:29,831 INFO L182 omatonBuilderFactory]: Interpolants [7334#true, 7335#false, 7336#(= (select |#valid| main_~list~0.base) 1), 7337#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7338#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|))), 7339#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7340#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 7341#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7342#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7343#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7344#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 1 (select |#valid| |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 7345#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7346#(and (not (= main_~end~0.base |main_#t~mem16.base|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)))), 7347#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem18.base|)) (not (= main_~list~0.base |main_#t~mem18.base|))), 7348#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 7349#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7350#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7351#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem26.base|) |main_#t~mem26.offset|))), 7352#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7353#(= 1 (select |#valid| |main_#t~mem23.base|)), 7354#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:34:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:29,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:34:29,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:34:29,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:34:29,832 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 21 states. [2018-02-02 10:34:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:30,571 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-02-02 10:34:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:34:30,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-02-02 10:34:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:30,571 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:34:30,572 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:34:30,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:34:30,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:34:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2018-02-02 10:34:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 10:34:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-02-02 10:34:30,574 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-02-02 10:34:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:30,574 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-02-02 10:34:30,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:34:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-02-02 10:34:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:34:30,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:30,574 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:30,574 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash -112377492, now seen corresponding path program 1 times [2018-02-02 10:34:30,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:30,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:30,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:30,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:34:30,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:30,981 INFO L182 omatonBuilderFactory]: Interpolants [7712#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 7713#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 7714#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 7715#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem26.base|) |main_#t~mem26.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) |main_#t~mem26.offset|))), 7716#(and (= 12 (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))), 7717#(and (= 0 |main_#t~mem23.offset|) (= 12 (select |#length| |main_#t~mem23.base|))), 7718#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base))), 7698#true, 7699#false, 7700#(= (select |#valid| main_~list~0.base) 1), 7701#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7702#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc5.base|))), 7703#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7704#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 7705#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7706#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7707#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7708#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 7709#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7710#(and (not (= main_~end~0.base |main_#t~mem16.base|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem16.base| (store (select |#memory_$Pointer$.base| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)))), 7711#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem18.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem18.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))))] [2018-02-02 10:34:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:30,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:34:30,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:34:30,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:34:30,982 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 21 states. [2018-02-02 10:34:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:31,682 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-02 10:34:31,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:34:31,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-02-02 10:34:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:31,683 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:34:31,683 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:34:31,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:34:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:34:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-02-02 10:34:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 10:34:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-02-02 10:34:31,685 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-02-02 10:34:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:31,685 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-02-02 10:34:31,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:34:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-02-02 10:34:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:34:31,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:31,685 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:31,685 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1937802051, now seen corresponding path program 3 times [2018-02-02 10:34:31,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:31,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:32,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:32,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:34:32,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:32,328 INFO L182 omatonBuilderFactory]: Interpolants [8064#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 8065#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 8066#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 8067#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc5.offset|)) main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc5.base|)) main_~list~0.base) main_~list~0.offset))) (and (= 0 |main_#t~malloc5.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)))) (not (= main_~list~0.base |main_#t~malloc5.base|)) (not (= main_~end~0.base |main_#t~malloc5.base|))), 8068#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8069#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (or (and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))))) (not (= main_~end~0.base |main_#t~mem7.base|))), 8070#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))))), 8071#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8072#(and (not (= main_~end~0.base main_~list~0.base)) (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset))), 8073#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8074#(and (<= 12 (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))), 8075#(and (<= 12 (select |#length| |main_#t~mem26.base|)) (= 0 |main_#t~mem26.offset|)), 8076#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base))), 8054#true, 8055#false, 8056#(= 0 |main_#t~malloc0.offset|), 8057#(= 0 main_~list~0.offset), 8058#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8059#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8060#(and (= 0 |main_#t~malloc5.offset|) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| main_~list~0.offset)), 8061#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8062#(and (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 8063#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem9.offset| main_~list~0.offset))] [2018-02-02 10:34:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:32,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:34:32,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:34:32,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:34:32,329 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 23 states. [2018-02-02 10:34:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:33,414 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-02 10:34:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:34:33,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:34:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:33,415 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:34:33,415 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:34:33,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:34:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:34:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 168. [2018-02-02 10:34:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:34:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-02-02 10:34:33,417 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 63 [2018-02-02 10:34:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:33,417 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-02-02 10:34:33,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:34:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-02-02 10:34:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:34:33,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:33,418 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:33,418 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1937802050, now seen corresponding path program 2 times [2018-02-02 10:34:33,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:33,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:33,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:33,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:34:33,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:33,970 INFO L182 omatonBuilderFactory]: Interpolants [8512#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem9.offset| main_~list~0.offset)), 8513#(or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1))), 8514#(and (or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 8515#(and (or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|))) (and (not (= main_~list~0.base |main_#t~malloc5.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc5.base|)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base |main_#t~malloc5.base|))), 8516#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base)) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8517#(and (or (and (= main_~end~0.base main_~list~0.base) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset)))) (and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem7.base|))), 8518#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~end~0.base) 1)), 8519#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8520#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset 0)) main_~list~0.base) main_~list~0.offset)))), 8521#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8522#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8523#(= 1 (select |#valid| |main_#t~mem26.base|)), 8524#(= 1 (select |#valid| main_~end~0.base)), 8502#true, 8503#false, 8504#(= 0 |main_#t~malloc0.offset|), 8505#(= 0 main_~list~0.offset), 8506#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8507#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8508#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| main_~list~0.offset)), 8509#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8510#(and (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base |main_#t~mem7.base|))), 8511#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 10:34:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:33,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:34:33,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:34:33,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:34:33,971 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 23 states. [2018-02-02 10:34:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:34,898 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-02-02 10:34:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:34:34,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:34:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:34,899 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:34:34,899 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:34:34,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:34:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:34:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 168. [2018-02-02 10:34:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:34:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-02-02 10:34:34,902 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-02-02 10:34:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:34,902 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-02-02 10:34:34,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:34:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-02-02 10:34:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:34:34,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:34,902 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:34,902 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2058261949, now seen corresponding path program 1 times [2018-02-02 10:34:34,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:34:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:34:34,955 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:34:34,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:34:34 BoogieIcfgContainer [2018-02-02 10:34:34,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:34:34,989 INFO L168 Benchmark]: Toolchain (without parser) took 17983.58 ms. Allocated memory was 402.1 MB in the beginning and 918.0 MB in the end (delta: 515.9 MB). Free memory was 356.2 MB in the beginning and 459.6 MB in the end (delta: -103.4 MB). Peak memory consumption was 412.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:34,989 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 402.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:34:34,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.05 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 343.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:34,990 INFO L168 Benchmark]: Boogie Preprocessor took 27.62 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 340.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 10:34:34,990 INFO L168 Benchmark]: RCFGBuilder took 430.33 ms. Allocated memory is still 402.1 MB. Free memory was 340.3 MB in the beginning and 304.6 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:34,990 INFO L168 Benchmark]: TraceAbstraction took 17352.84 ms. Allocated memory was 402.1 MB in the beginning and 918.0 MB in the end (delta: 515.9 MB). Free memory was 304.6 MB in the beginning and 459.6 MB in the end (delta: -155.0 MB). Peak memory consumption was 360.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:34,991 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.16 ms. Allocated memory is still 402.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.05 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 343.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.62 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 340.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 430.33 ms. Allocated memory is still 402.1 MB. Free memory was 340.3 MB in the beginning and 304.6 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17352.84 ms. Allocated memory was 402.1 MB in the beginning and 918.0 MB in the end (delta: 515.9 MB). Free memory was 304.6 MB in the beginning and 459.6 MB in the end (delta: -155.0 MB). Peak memory consumption was 360.9 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: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={30:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={30:0}, malloc(sizeof(SLL))={30:0}] [L995] FCALL list->next = ((void*)0) VAL [list={30:0}, malloc(sizeof(SLL))={30:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={30:0}, malloc(sizeof(SLL))={30:0}] [L997] FCALL list->colour = BLACK VAL [list={30:0}, malloc(sizeof(SLL))={30:0}] [L999] SLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1006] EXPR, FCALL end->next VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1006] FCALL end->next->prev = end VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1007] EXPR, FCALL end->next VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={15:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1018] EXPR, FCALL end->next VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1018] FCALL end->next->prev = end VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1019] EXPR, FCALL end->next VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1021] FCALL end->colour = BLACK VAL [end={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(0) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1030] EXPR, FCALL end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={30:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1041] EXPR, FCALL end->next VAL [end={30:0}, end->next={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={15:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={15:0}, end->colour=0, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={15:0}, end->next={27:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={27:0}, end->next={0:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] [L1037] end = end->next [L1040] FCALL end->next VAL [end={0:0}, list={30:0}, malloc(sizeof(SLL))={30:0}, malloc(sizeof(SLL))={27:0}, malloc(sizeof(SLL))={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 59 error locations. UNSAFE Result, 17.3s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1849 SDtfs, 6873 SDslu, 7397 SDs, 0 SdLazy, 12036 SolverSat, 1309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 56 SyntacticMatches, 27 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/118 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 966 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 950 ConstructedInterpolants, 0 QuantifiedInterpolants, 723776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 17/118 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/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-34-34-996.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-34-34-996.csv Received shutdown request...