java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:31:43,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:31:43,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:31:43,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:31:43,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:31:43,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:31:43,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:31:43,622 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:31:43,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:31:43,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:31:43,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:31:43,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:31:43,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:31:43,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:31:43,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:31:43,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:31:43,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:31:43,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:31:43,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:31:43,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:31:43,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:31:43,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:31:43,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:31:43,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:31:43,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:31:43,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:31:43,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:31:43,639 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:31:43,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:31:43,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:31:43,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:31:43,640 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:31:43,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:31:43,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:31:43,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:31:43,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:31:43,651 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:31:43,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:31:43,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:31:43,652 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:31:43,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:31:43,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:31:43,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:31:43,653 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:31:43,653 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:31:43,653 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:31:43,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:31:43,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:31:43,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:31:43,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:31:43,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:31:43,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:31:43,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:31:43,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:31:43,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:31:43,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:31:43,693 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:31:43,696 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:31:43,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:31:43,697 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:31:43,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:31:43,832 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:31:43,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:31:43,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:31:43,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:31:43,840 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:31:43,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:31:43" (1/1) ... [2018-02-02 10:31:43,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4817ffc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:43, skipping insertion in model container [2018-02-02 10:31:43,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:31:43" (1/1) ... [2018-02-02 10:31:43,857 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:31:43,891 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:31:43,987 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:31:44,001 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:31:44,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44 WrapperNode [2018-02-02 10:31:44,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:31:44,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:31:44,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:31:44,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:31:44,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (1/1) ... [2018-02-02 10:31:44,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:31:44,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:31:44,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:31:44,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:31:44,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (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:31:44,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:31:44,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:31:44,077 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:31:44,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:31:44,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:31:44,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:31:44,079 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:31:44,389 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:31:44,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:31:44 BoogieIcfgContainer [2018-02-02 10:31:44,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:31:44,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:31:44,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:31:44,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:31:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:31:43" (1/3) ... [2018-02-02 10:31:44,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:31:44, skipping insertion in model container [2018-02-02 10:31:44,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:31:44" (2/3) ... [2018-02-02 10:31:44,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:31:44, skipping insertion in model container [2018-02-02 10:31:44,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:31:44" (3/3) ... [2018-02-02 10:31:44,396 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:31:44,403 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:31:44,410 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 10:31:44,434 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:31:44,435 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:31:44,435 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:31:44,435 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:31:44,435 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:31:44,435 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:31:44,435 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:31:44,435 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:31:44,436 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:31:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-02-02 10:31:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:31:44,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:44,455 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:44,455 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691577, now seen corresponding path program 1 times [2018-02-02 10:31:44,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:44,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:44,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:44,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,573 INFO L182 omatonBuilderFactory]: Interpolants [120#true, 121#false, 122#(= 1 (select |#valid| |main_#t~malloc0.base|)), 123#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:31:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:44,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:44,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:44,583 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 4 states. [2018-02-02 10:31:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:44,826 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-02-02 10:31:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:44,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:31:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:44,836 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:31:44,836 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:31:44,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:31:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2018-02-02 10:31:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:31:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-02 10:31:44,873 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 8 [2018-02-02 10:31:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:44,873 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-02 10:31:44,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-02 10:31:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:31:44,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:44,874 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:44,874 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691576, now seen corresponding path program 1 times [2018-02-02 10:31:44,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:44,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:44,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:44,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,935 INFO L182 omatonBuilderFactory]: Interpolants [368#false, 369#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 370#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8)), 367#true] [2018-02-02 10:31:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:44,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:44,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:44,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:44,937 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 4 states. [2018-02-02 10:31:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:45,070 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-02-02 10:31:45,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:31:45,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:31:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:45,072 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:31:45,072 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:31:45,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:31:45,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2018-02-02 10:31:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:31:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-02 10:31:45,081 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 8 [2018-02-02 10:31:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:45,082 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-02 10:31:45,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-02 10:31:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:31:45,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:45,083 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:45,083 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1176954998, now seen corresponding path program 1 times [2018-02-02 10:31:45,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:45,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:31:45,146 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,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:31:45,147 INFO L182 omatonBuilderFactory]: Interpolants [613#true, 614#false, 615#(= (select |#valid| main_~list~0.base) 1), 616#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:31:45,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:31:45,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:31:45,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:31:45,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:31:45,147 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 4 states. [2018-02-02 10:31:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:45,260 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-02 10:31:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:45,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:31:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:45,262 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:31:45,262 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:31:45,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:31:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2018-02-02 10:31:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:31:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-02-02 10:31:45,269 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 15 [2018-02-02 10:31:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:45,270 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-02-02 10:31:45,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:31:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-02-02 10:31:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:31:45,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:45,271 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:45,271 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1176954997, now seen corresponding path program 1 times [2018-02-02 10:31:45,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:45,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:31:45,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,359 INFO L182 omatonBuilderFactory]: Interpolants [850#true, 851#false, 852#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 853#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 854#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1)), 855#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 856#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:31:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:31:45,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:31:45,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:31:45,359 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 7 states. [2018-02-02 10:31:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:45,648 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-02 10:31:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:31:45,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:31:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:45,650 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:31:45,650 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:31:45,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:31:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:31:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2018-02-02 10:31:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:31:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-02-02 10:31:45,656 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 15 [2018-02-02 10:31:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:45,656 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-02-02 10:31:45,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:31:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-02-02 10:31:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:31:45,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:45,657 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:31:45,657 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1446653265, now seen corresponding path program 1 times [2018-02-02 10:31:45,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:45,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:45,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,705 INFO L182 omatonBuilderFactory]: Interpolants [1120#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1121#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1122#(= 1 (select |#valid| |main_#t~mem6.base|)), 1123#(= 1 (select |#valid| main_~end~0.base)), 1118#true, 1119#false] [2018-02-02 10:31:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:45,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:45,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:45,706 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 6 states. [2018-02-02 10:31:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:45,872 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2018-02-02 10:31:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:45,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:31:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:45,874 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:31:45,874 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:31:45,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:31:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 115. [2018-02-02 10:31:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:31:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2018-02-02 10:31:45,879 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 18 [2018-02-02 10:31:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:45,880 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2018-02-02 10:31:45,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2018-02-02 10:31:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:31:45,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:45,881 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:31:45,881 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1446653266, now seen corresponding path program 1 times [2018-02-02 10:31:45,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:45,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:45,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:45,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,947 INFO L182 omatonBuilderFactory]: Interpolants [1431#true, 1432#false, 1433#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1434#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 1435#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1436#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:31:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:45,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:45,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:45,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:45,948 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 6 states. [2018-02-02 10:31:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,122 INFO L93 Difference]: Finished difference Result 189 states and 207 transitions. [2018-02-02 10:31:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:46,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:31:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,123 INFO L225 Difference]: With dead ends: 189 [2018-02-02 10:31:46,123 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:31:46,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:31:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:31:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 110. [2018-02-02 10:31:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:31:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-02-02 10:31:46,127 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2018-02-02 10:31:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,128 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-02-02 10:31:46,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-02-02 10:31:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:31:46,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,129 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:46,129 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1020537408, now seen corresponding path program 1 times [2018-02-02 10:31:46,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:46,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:46,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:46,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,178 INFO L182 omatonBuilderFactory]: Interpolants [1747#true, 1748#false, 1749#(= 1 (select |#valid| |main_#t~malloc11.base|)), 1750#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1751#(= 1 (select |#valid| |main_#t~mem13.base|)), 1752#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:31:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:46,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:46,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:46,179 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 6 states. [2018-02-02 10:31:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,350 INFO L93 Difference]: Finished difference Result 198 states and 218 transitions. [2018-02-02 10:31:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:46,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:31:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,351 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:31:46,351 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:31:46,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:31:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 109. [2018-02-02 10:31:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:31:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-02-02 10:31:46,354 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 26 [2018-02-02 10:31:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,354 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-02-02 10:31:46,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-02-02 10:31:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:31:46,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,355 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:46,355 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1020537407, now seen corresponding path program 1 times [2018-02-02 10:31:46,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:46,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:46,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:46,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,421 INFO L182 omatonBuilderFactory]: Interpolants [2067#true, 2068#false, 2069#(and (= 0 |main_#t~malloc11.offset|) (= 8 (select |#length| |main_#t~malloc11.base|))), 2070#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2071#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 2072#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:31:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:46,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:46,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:46,422 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 6 states. [2018-02-02 10:31:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,608 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2018-02-02 10:31:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:31:46,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:31:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,609 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:31:46,609 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:31:46,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:31:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 99. [2018-02-02 10:31:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:31:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-02 10:31:46,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 26 [2018-02-02 10:31:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,613 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-02 10:31:46,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-02 10:31:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:31:46,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,614 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] [2018-02-02 10:31:46,615 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1179857763, now seen corresponding path program 1 times [2018-02-02 10:31:46,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:46,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:46,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:46,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,655 INFO L182 omatonBuilderFactory]: Interpolants [2370#true, 2371#false, 2372#(not (= 0 |main_#t~malloc0.base|)), 2373#(not (= 0 main_~list~0.base)), 2374#(not (= 0 main_~end~0.base))] [2018-02-02 10:31:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:31:46,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:31:46,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:46,655 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-02-02 10:31:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,733 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 10:31:46,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:46,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-02 10:31:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,735 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:31:46,735 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:31:46,736 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:31:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:31:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-02-02 10:31:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:31:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-02-02 10:31:46,738 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 27 [2018-02-02 10:31:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,738 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-02-02 10:31:46,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:31:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-02-02 10:31:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:31:46,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,739 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] [2018-02-02 10:31:46,740 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2127198597, now seen corresponding path program 1 times [2018-02-02 10:31:46,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:46,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:46,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:31:46,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,833 INFO L182 omatonBuilderFactory]: Interpolants [2592#true, 2593#false, 2594#(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))), 2595#(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))), 2596#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 2597#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 10:31:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:46,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:31:46,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:31:46,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:31:46,834 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 6 states. [2018-02-02 10:31:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:46,993 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2018-02-02 10:31:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:31:46,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:31:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:46,994 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:31:46,994 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:31:46,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:31:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 118. [2018-02-02 10:31:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:31:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-02-02 10:31:46,996 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 30 [2018-02-02 10:31:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:46,996 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-02-02 10:31:46,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:31:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-02-02 10:31:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:31:46,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:46,997 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:46,997 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1759872929, now seen corresponding path program 1 times [2018-02-02 10:31:46,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:47,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:31:47,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:31:47,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,061 INFO L182 omatonBuilderFactory]: Interpolants [2880#true, 2881#false, 2882#(= |main_#t~mem16| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2883#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 2884#(= ~unnamed0~BLACK |main_#t~mem17|)] [2018-02-02 10:31:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:31:47,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:31:47,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:47,061 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-02-02 10:31:47,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:47,125 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-02-02 10:31:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:31:47,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 10:31:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:47,126 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:31:47,126 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:31:47,127 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:31:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:31:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2018-02-02 10:31:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:31:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 10:31:47,129 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 32 [2018-02-02 10:31:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:47,130 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 10:31:47,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:31:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 10:31:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:31:47,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:47,131 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:47,131 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1741137725, now seen corresponding path program 1 times [2018-02-02 10:31:47,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:47,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:47,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:31:47,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,190 INFO L182 omatonBuilderFactory]: Interpolants [3126#true, 3127#false, 3128#(= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))), 3129#(and (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem16|) (= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))), 3130#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))), 3131#(= |main_#t~mem17| (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))), 3132#(not (= ~unnamed0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))), 3133#(not (= ~unnamed0~RED |main_#t~mem21|))] [2018-02-02 10:31:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:31:47,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:31:47,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:31:47,191 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 8 states. [2018-02-02 10:31:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:47,379 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-02-02 10:31:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:47,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-02 10:31:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:47,380 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:31:47,380 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:31:47,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:31:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2018-02-02 10:31:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:31:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 10:31:47,383 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2018-02-02 10:31:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:47,383 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 10:31:47,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:31:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 10:31:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:31:47,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:47,384 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] [2018-02-02 10:31:47,384 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -305122759, now seen corresponding path program 1 times [2018-02-02 10:31:47,385 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:47,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:31:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:47,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:31:47,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,462 INFO L182 omatonBuilderFactory]: Interpolants [3408#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset)), 3409#(and (= main_~list~0.offset 0) (= 0 main_~list~0.base)), 3403#true, 3404#false, 3405#(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))), 3406#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3407#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|))] [2018-02-02 10:31:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:31:47,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:31:47,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:31:47,462 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 7 states. [2018-02-02 10:31:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:47,574 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-02-02 10:31:47,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:31:47,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-02-02 10:31:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:47,575 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:31:47,575 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:31:47,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:31:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:31:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-02-02 10:31:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:31:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 10:31:47,577 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 40 [2018-02-02 10:31:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:47,584 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 10:31:47,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:31:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 10:31:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:31:47,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:47,585 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:47,585 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -868871624, now seen corresponding path program 1 times [2018-02-02 10:31:47,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:47,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:47,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:47,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:31:47,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,648 INFO L182 omatonBuilderFactory]: Interpolants [3669#true, 3670#false, 3671#(= |#valid| |old(#valid)|), 3672#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 3673#(and (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|))] [2018-02-02 10:31:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:47,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:31:47,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:31:47,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:31:47,649 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 5 states. [2018-02-02 10:31:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:47,765 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-02-02 10:31:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:31:47,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-02 10:31:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:47,766 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:31:47,767 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 10:31:47,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:31:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 10:31:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-02-02 10:31:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:31:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-02-02 10:31:47,769 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 41 [2018-02-02 10:31:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:47,769 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-02-02 10:31:47,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:31:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-02-02 10:31:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:31:47,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:47,770 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] [2018-02-02 10:31:47,770 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash -671794398, now seen corresponding path program 1 times [2018-02-02 10:31:47,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:47,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:47,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:31:47,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,894 INFO L182 omatonBuilderFactory]: Interpolants [3905#true, 3906#false, 3907#(= (select |#valid| main_~list~0.base) 1), 3908#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 3909#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 3910#(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)))), 3911#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 3912#(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))), 3913#(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_~end~0.base) 1)), 3914#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 3915#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3916#(= 1 (select |#valid| |main_#t~mem20.base|)), 3917#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:31:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:47,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:31:47,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:31:47,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:31:47,894 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 13 states. [2018-02-02 10:31:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:48,199 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-02-02 10:31:48,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:31:48,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-02-02 10:31:48,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:48,200 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:31:48,200 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:31:48,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:31:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:31:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 126. [2018-02-02 10:31:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:31:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 10:31:48,203 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 41 [2018-02-02 10:31:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:48,204 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 10:31:48,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:31:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 10:31:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:31:48,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:48,204 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] [2018-02-02 10:31:48,205 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash -671794397, now seen corresponding path program 1 times [2018-02-02 10:31:48,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:48,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:48,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:31:48,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,363 INFO L182 omatonBuilderFactory]: Interpolants [4240#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4241#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4242#(and (= main_~end~0.base main_~list~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| 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)))), 4243#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 4244#(and (= 8 (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))) (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))), 4245#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 4246#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4247#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 4248#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 4237#true, 4238#false, 4239#(= (select |#valid| main_~list~0.base) 1)] [2018-02-02 10:31:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:48,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:48,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:48,363 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 12 states. [2018-02-02 10:31:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:48,780 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-02-02 10:31:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:31:48,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 10:31:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:48,781 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:31:48,781 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:31:48,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:31:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 128. [2018-02-02 10:31:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:31:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-02-02 10:31:48,783 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 41 [2018-02-02 10:31:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:48,784 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-02-02 10:31:48,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-02-02 10:31:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:31:48,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:48,784 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:48,785 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1145218568, now seen corresponding path program 2 times [2018-02-02 10:31:48,786 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:48,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:48,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:48,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,988 INFO L182 omatonBuilderFactory]: Interpolants [4576#(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)))), 4577#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 4578#(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))), 4579#(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))), 4580#(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)))), 4581#(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)))), 4582#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 4583#(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))), 4584#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 4585#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 4571#true, 4572#false, 4573#(= (select |#valid| main_~list~0.base) 1), 4574#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4575#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset))] [2018-02-02 10:31:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:48,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:48,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:48,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:48,988 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 15 states. [2018-02-02 10:31:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:49,518 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-02-02 10:31:49,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:31:49,518 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-02 10:31:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:49,518 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:31:49,519 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:31:49,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:31:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 132. [2018-02-02 10:31:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 10:31:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-02-02 10:31:49,521 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 47 [2018-02-02 10:31:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:49,521 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-02-02 10:31:49,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-02-02 10:31:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:31:49,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:49,521 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] [2018-02-02 10:31:49,521 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1238578519, now seen corresponding path program 1 times [2018-02-02 10:31:49,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:49,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:49,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:49,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,702 INFO L182 omatonBuilderFactory]: Interpolants [4928#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 4929#(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)))), 4930#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 4931#(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)), 4932#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset))), 4933#(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)) (= 1 (select |#valid| main_~end~0.base))), 4934#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 4935#(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)))), 4936#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4938#(= 1 (select |#valid| |main_#t~mem20.base|)), 4939#(= 1 (select |#valid| main_~end~0.base)), 4924#true, 4925#false, 4926#(= (select |#valid| main_~list~0.base) 1), 4927#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 10:31:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:49,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:31:49,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:31:49,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:31:49,702 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand 16 states. [2018-02-02 10:31:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:50,316 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-02-02 10:31:50,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:31:50,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-02-02 10:31:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:50,318 INFO L225 Difference]: With dead ends: 204 [2018-02-02 10:31:50,318 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:31:50,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:31:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:31:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 159. [2018-02-02 10:31:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:31:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2018-02-02 10:31:50,321 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 47 [2018-02-02 10:31:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:50,321 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2018-02-02 10:31:50,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:31:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2018-02-02 10:31:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:31:50,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:50,322 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] [2018-02-02 10:31:50,322 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1238578518, now seen corresponding path program 1 times [2018-02-02 10:31:50,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:50,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:50,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:31:50,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,608 INFO L182 omatonBuilderFactory]: Interpolants [5344#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 5345#(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)) (= 8 (select |#length| main_~end~0.base))), 5346#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 5347#(and (= 8 (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))) (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))), 5348#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5349#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5350#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 5351#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 5335#true, 5336#false, 5337#(= (select |#valid| main_~list~0.base) 1), 5338#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5339#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 5340#(and (= 8 (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)))), 5341#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 5342#(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) (= 8 (select |#length| main_~end~0.base))), 5343#(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)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base)))] [2018-02-02 10:31:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:50,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:50,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:50,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:50,609 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand 17 states. [2018-02-02 10:31:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:51,154 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-02-02 10:31:51,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:31:51,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:31:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:51,155 INFO L225 Difference]: With dead ends: 209 [2018-02-02 10:31:51,155 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 10:31:51,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 10:31:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 160. [2018-02-02 10:31:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:31:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-02-02 10:31:51,158 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 47 [2018-02-02 10:31:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:51,158 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-02-02 10:31:51,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2018-02-02 10:31:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:31:51,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:51,159 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] [2018-02-02 10:31:51,159 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -883038036, now seen corresponding path program 1 times [2018-02-02 10:31:51,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:51,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:51,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:51,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:51,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:51,426 INFO L182 omatonBuilderFactory]: Interpolants [5745#true, 5746#false, 5747#(= (select |#valid| main_~list~0.base) 1), 5748#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5749#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 5750#(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)))), 5751#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 5752#(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))), 5753#(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))), 5754#(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)))), 5755#(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)))), 5756#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 5757#(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))), 5758#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 5759#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 10:31:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:51,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:31:51,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:31:51,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:31:51,427 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 15 states. [2018-02-02 10:31:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:51,862 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-02-02 10:31:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:31:51,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-02-02 10:31:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:51,863 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:31:51,863 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:31:51,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:31:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:31:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 160. [2018-02-02 10:31:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:31:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2018-02-02 10:31:51,866 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 49 [2018-02-02 10:31:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:51,866 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2018-02-02 10:31:51,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:31:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-02-02 10:31:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:31:51,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:51,867 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] [2018-02-02 10:31:51,867 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:51,867 INFO L82 PathProgramCache]: Analyzing trace with hash 279937568, now seen corresponding path program 1 times [2018-02-02 10:31:51,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:51,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:51,967 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:51,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:31:51,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:51,968 INFO L182 omatonBuilderFactory]: Interpolants [6132#true, 6133#false, 6134#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 6135#(and (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.base|)), 6136#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 6137#(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))), 6138#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 6139#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset)), 6140#(and (= main_~list~0.offset 0) (= 0 main_~list~0.base))] [2018-02-02 10:31:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:31:51,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:31:51,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:31:51,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:31:51,968 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 9 states. [2018-02-02 10:31:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:52,274 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-02-02 10:31:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:31:52,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 10:31:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:52,275 INFO L225 Difference]: With dead ends: 199 [2018-02-02 10:31:52,275 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 10:31:52,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:31:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 10:31:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2018-02-02 10:31:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:31:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 186 transitions. [2018-02-02 10:31:52,277 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 186 transitions. Word has length 51 [2018-02-02 10:31:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:52,277 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 186 transitions. [2018-02-02 10:31:52,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:31:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 186 transitions. [2018-02-02 10:31:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:31:52,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:52,278 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] [2018-02-02 10:31:52,278 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:52,278 INFO L82 PathProgramCache]: Analyzing trace with hash 88129329, now seen corresponding path program 1 times [2018-02-02 10:31:52,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:52,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:52,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:52,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:31:52,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,376 INFO L182 omatonBuilderFactory]: Interpolants [6528#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (not (= |main_#t~malloc4.base| 0))), 6529#(and (= main_~end~0.base main_~list~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6530#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~mem6.base|))), 6531#(and (not (= main_~end~0.base main_~list~0.base)) (not (= (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))), 6532#(not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)), 6533#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)), 6534#(not (= |main_#t~mem20.base| 0)), 6535#(not (= main_~end~0.base 0)), 6524#true, 6525#false, 6526#(= (select |#valid| main_~list~0.base) 1), 6527#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 10:31:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:31:52,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:31:52,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:31:52,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:31:52,376 INFO L87 Difference]: Start difference. First operand 174 states and 186 transitions. Second operand 12 states. [2018-02-02 10:31:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:52,681 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2018-02-02 10:31:52,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:31:52,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-02-02 10:31:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:52,683 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:31:52,683 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:31:52,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:31:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2018-02-02 10:31:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:31:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-02-02 10:31:52,685 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 52 [2018-02-02 10:31:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:52,685 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-02-02 10:31:52,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:31:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-02-02 10:31:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:31:52,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:52,686 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:31:52,686 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 285206555, now seen corresponding path program 3 times [2018-02-02 10:31:52,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:52,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:52,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:31:52,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,839 INFO L182 omatonBuilderFactory]: Interpolants [6913#true, 6914#false, 6915#(= (select |#valid| main_~list~0.base) 1), 6916#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6917#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 6918#(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)))), 6919#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 6920#(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)), 6921#(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 |main_#t~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 6922#(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)), 6923#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 6924#(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)))), 6925#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6926#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6927#(= 1 (select |#valid| |main_#t~mem20.base|)), 6928#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:31:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:52,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:31:52,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:31:52,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:31:52,839 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 16 states. [2018-02-02 10:31:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:53,467 INFO L93 Difference]: Finished difference Result 249 states and 265 transitions. [2018-02-02 10:31:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:53,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-02-02 10:31:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:53,468 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:31:53,468 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:31:53,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:31:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:31:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 202. [2018-02-02 10:31:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:31:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2018-02-02 10:31:53,472 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 52 [2018-02-02 10:31:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:53,472 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2018-02-02 10:31:53,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:31:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2018-02-02 10:31:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:31:53,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:53,473 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:31:53,473 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 285206556, now seen corresponding path program 2 times [2018-02-02 10:31:53,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:53,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:53,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:31:53,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,716 INFO L182 omatonBuilderFactory]: Interpolants [7424#(and (= 8 (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))) (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))), 7425#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7426#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7427#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 7428#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 7412#true, 7413#false, 7414#(= (select |#valid| main_~list~0.base) 1), 7415#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7416#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 7417#(and (= 8 (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)))), 7418#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 7419#(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) (= 8 (select |#length| main_~end~0.base))), 7420#(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)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 7421#(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 |main_#t~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 8 (select |#length| main_~end~0.base))), 7422#(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)) (= 8 (select |#length| main_~end~0.base))), 7423#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|)))] [2018-02-02 10:31:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:53,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:31:53,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:31:53,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:31:53,717 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand 17 states. [2018-02-02 10:31:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:54,306 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2018-02-02 10:31:54,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:31:54,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:31:54,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:54,307 INFO L225 Difference]: With dead ends: 255 [2018-02-02 10:31:54,307 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 10:31:54,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:31:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 10:31:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 182. [2018-02-02 10:31:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:31:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2018-02-02 10:31:54,310 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 52 [2018-02-02 10:31:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:54,310 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2018-02-02 10:31:54,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:31:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2018-02-02 10:31:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:54,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:54,311 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:31:54,311 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash -574868401, now seen corresponding path program 2 times [2018-02-02 10:31:54,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:54,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:54,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:54,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:54,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:54,537 INFO L182 omatonBuilderFactory]: Interpolants [7904#(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))) (= 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)) (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)))), 7905#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= 1 (select |#valid| main_~end~0.base))), 7906#(= 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)))), 7907#(= 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)))), 7908#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 7909#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7910#(= 1 (select |#valid| |main_#t~mem20.base|)), 7911#(= 1 (select |#valid| main_~end~0.base)), 7892#true, 7893#false, 7894#(= (select |#valid| main_~list~0.base) 1), 7895#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7896#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 7897#(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)))), 7898#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 7899#(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)), 7900#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7901#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 7902#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 7903#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= |main_#t~mem13.base| (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 (= main_~list~0.base |main_#t~mem13.base|)))] [2018-02-02 10:31:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:54,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:54,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:54,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:54,537 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 20 states. [2018-02-02 10:31:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:55,249 INFO L93 Difference]: Finished difference Result 257 states and 275 transitions. [2018-02-02 10:31:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:31:55,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 10:31:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:55,459 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:31:55,459 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:31:55,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:31:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:31:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 208. [2018-02-02 10:31:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:31:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-02-02 10:31:55,462 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 53 [2018-02-02 10:31:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:55,462 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-02-02 10:31:55,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-02-02 10:31:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:31:55,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:55,463 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:31:55,463 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash -574868400, now seen corresponding path program 2 times [2018-02-02 10:31:55,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:55,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:55,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:55,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:31:55,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:55,839 INFO L182 omatonBuilderFactory]: Interpolants [8416#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8417#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 8418#(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)))), 8419#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 8420#(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)), 8421#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8422#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~malloc11.offset|) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc11.base|))), 8423#(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)) (= 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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8424#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= 8 (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)))) (= 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~mem13.base|))), 8425#(and (= 8 (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)))) (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))) (= 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)))), 8426#(and (= 8 (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)))) (= 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)))), 8427#(and (= 8 (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)))) (= 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)))), 8428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 8429#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 8430#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 8431#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 8413#true, 8414#false, 8415#(= (select |#valid| main_~list~0.base) 1)] [2018-02-02 10:31:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:55,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:31:55,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:31:55,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:55,840 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 19 states. [2018-02-02 10:31:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:56,652 INFO L93 Difference]: Finished difference Result 263 states and 282 transitions. [2018-02-02 10:31:56,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:56,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-02-02 10:31:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:56,653 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:31:56,653 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:31:56,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:31:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:31:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 207. [2018-02-02 10:31:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:31:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 223 transitions. [2018-02-02 10:31:56,656 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 223 transitions. Word has length 53 [2018-02-02 10:31:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:56,656 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 223 transitions. [2018-02-02 10:31:56,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:31:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 223 transitions. [2018-02-02 10:31:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:31:56,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:56,656 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] [2018-02-02 10:31:56,656 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -324206285, now seen corresponding path program 1 times [2018-02-02 10:31:56,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:56,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:56,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:31:56,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,961 INFO L182 omatonBuilderFactory]: Interpolants [8928#true, 8929#false, 8930#(= (select |#valid| main_~list~0.base) 1), 8931#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8932#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 8933#(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)))), 8934#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 8935#(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)), 8936#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8937#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 8938#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 8939#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= |main_#t~mem13.base| (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 (= main_~list~0.base |main_#t~mem13.base|))), 8940#(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))) (= 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)) (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)))), 8941#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= 1 (select |#valid| main_~end~0.base))), 8942#(= 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)))), 8943#(= 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)))), 8944#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 8945#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8946#(= 1 (select |#valid| |main_#t~mem18.base|)), 8947#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:31:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:56,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:31:56,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:31:56,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:31:56,962 INFO L87 Difference]: Start difference. First operand 207 states and 223 transitions. Second operand 20 states. [2018-02-02 10:31:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:57,732 INFO L93 Difference]: Finished difference Result 259 states and 278 transitions. [2018-02-02 10:31:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:31:57,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 10:31:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:57,733 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:31:57,733 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:31:57,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:31:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:31:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 214. [2018-02-02 10:31:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:31:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 231 transitions. [2018-02-02 10:31:57,735 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 231 transitions. Word has length 55 [2018-02-02 10:31:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:57,735 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 231 transitions. [2018-02-02 10:31:57,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:31:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions. [2018-02-02 10:31:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:31:57,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:57,736 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] [2018-02-02 10:31:57,736 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash -324206284, now seen corresponding path program 1 times [2018-02-02 10:31:57,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:57,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:58,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:31:58,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,026 INFO L182 omatonBuilderFactory]: Interpolants [9472#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 9473#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 9455#true, 9456#false, 9457#(= (select |#valid| main_~list~0.base) 1), 9458#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9459#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 9460#(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)))), 9461#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 9462#(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)), 9463#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 9464#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~malloc11.offset|) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc11.base|))), 9465#(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)) (= 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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 9466#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= 8 (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)))) (= 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~mem13.base|))), 9467#(and (= 8 (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)))) (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))) (= 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)))), 9468#(and (= 8 (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)))) (= 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)))), 9469#(and (= 8 (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)))) (= 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)))), 9470#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 9471#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))] [2018-02-02 10:31:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:58,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:31:58,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:31:58,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:31:58,027 INFO L87 Difference]: Start difference. First operand 214 states and 231 transitions. Second operand 19 states. [2018-02-02 10:31:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:31:58,827 INFO L93 Difference]: Finished difference Result 264 states and 283 transitions. [2018-02-02 10:31:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:31:58,827 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 10:31:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:31:58,828 INFO L225 Difference]: With dead ends: 264 [2018-02-02 10:31:58,828 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 10:31:58,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:31:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 10:31:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 216. [2018-02-02 10:31:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:31:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-02 10:31:58,832 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 55 [2018-02-02 10:31:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:31:58,832 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-02 10:31:58,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:31:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-02 10:31:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:31:58,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:31:58,833 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:31:58,833 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:31:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1204222586, now seen corresponding path program 2 times [2018-02-02 10:31:58,834 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:31:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:31:58,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:31:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:31:59,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:31:59,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:31:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,160 INFO L182 omatonBuilderFactory]: Interpolants [9984#(and (not (= 0 main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~list~0.offset)), 9985#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 9986#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc4.offset| main_~list~0.offset)), 9987#(and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~list~0.offset) (not (= 0 main_~list~0.base)) (= 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)))), 9988#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset) (not (= main_~list~0.base |main_#t~mem6.base|))), 9989#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= (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) main_~list~0.offset)), 9990#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 9991#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 9992#(and (not (= 0 main_~list~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) |main_#t~mem20.offset|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.base|)), 9993#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= 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)))), 9994#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= main_~end~0.base main_~list~0.base) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))))), 9995#(and (not (= 0 main_~list~0.base)) (or (not (= 0 |main_#t~mem20.base|)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 9996#(and (not (= 0 main_~list~0.base)) (or (not (= 0 main_~end~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 9997#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9998#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem24.base|))), 9999#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 10000#(= 1 (select |#valid| main_~end~0.base)), 10001#(= 1 (select |#valid| main_~list~0.base)), 9980#true, 9981#false, 9982#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 9983#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset))] [2018-02-02 10:31:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:31:59,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:31:59,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:31:59,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:31:59,160 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 22 states. [2018-02-02 10:32:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:00,082 INFO L93 Difference]: Finished difference Result 240 states and 257 transitions. [2018-02-02 10:32:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:32:00,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-02 10:32:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:00,083 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:32:00,083 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:32:00,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=431, Invalid=1639, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:32:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:32:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227. [2018-02-02 10:32:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 10:32:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2018-02-02 10:32:00,085 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 57 [2018-02-02 10:32:00,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:00,085 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2018-02-02 10:32:00,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2018-02-02 10:32:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:32:00,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:00,086 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:00,086 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1204222585, now seen corresponding path program 1 times [2018-02-02 10:32:00,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:00,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:00,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:00,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:32:00,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:00,300 INFO L134 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:32:00,300 INFO L182 omatonBuilderFactory]: Interpolants [10528#(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))), 10529#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= (+ main_~end~0.offset 8) (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 10531#(and (<= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 10532#(and (<= 8 (select |#length| main_~end~0.base)) (= 0 main_~end~0.offset)), 10533#(and (= main_~list~0.offset 0) (<= 8 (select |#length| main_~list~0.base))), 10517#true, 10518#false, 10519#(= (select |#valid| main_~list~0.base) 1), 10520#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 10521#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|)), 10522#(and (= main_~end~0.base main_~list~0.base) (= 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)))), 10523#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|))), 10524#(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))), 10525#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)), 10526#(and (= 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))), 10527#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))] [2018-02-02 10:32:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:00,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:32:00,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:32:00,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:32:00,301 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand 17 states. [2018-02-02 10:32:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:00,777 INFO L93 Difference]: Finished difference Result 243 states and 260 transitions. [2018-02-02 10:32:00,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:32:00,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-02 10:32:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:00,778 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:32:00,778 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:32:00,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:32:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:32:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-02-02 10:32:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:32:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-02-02 10:32:00,781 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 57 [2018-02-02 10:32:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:00,781 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-02-02 10:32:00,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:32:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-02-02 10:32:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:00,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:00,781 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:00,781 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1323804811, now seen corresponding path program 2 times [2018-02-02 10:32:00,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:00,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:00,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:00,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:00,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:00,857 INFO L134 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:32:00,858 INFO L182 omatonBuilderFactory]: Interpolants [11042#true, 11043#false, 11044#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base)), 11045#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.base|)), 11046#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11047#(or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0))), 11048#(or (not (= |main_#t~mem24.base| 0)) (not (= |main_#t~mem24.offset| 0))), 11049#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 11050#(or (not (= main_~list~0.offset 0)) (not (= main_~list~0.base 0)))] [2018-02-02 10:32:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:00,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:32:00,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:32:00,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:32:00,858 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 9 states. [2018-02-02 10:32:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:01,072 INFO L93 Difference]: Finished difference Result 266 states and 286 transitions. [2018-02-02 10:32:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:01,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-02-02 10:32:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:01,073 INFO L225 Difference]: With dead ends: 266 [2018-02-02 10:32:01,073 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 10:32:01,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 10:32:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 237. [2018-02-02 10:32:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:32:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 254 transitions. [2018-02-02 10:32:01,076 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 254 transitions. Word has length 58 [2018-02-02 10:32:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:01,076 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 254 transitions. [2018-02-02 10:32:01,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:32:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 254 transitions. [2018-02-02 10:32:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:01,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:01,076 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:01,077 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 831255617, now seen corresponding path program 4 times [2018-02-02 10:32:01,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:01,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:01,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:01,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:01,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:01,316 INFO L134 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:32:01,317 INFO L182 omatonBuilderFactory]: Interpolants [11584#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 11585#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 11586#(= 1 (select |#valid| |main_#t~mem20.base|)), 11587#(= 1 (select |#valid| main_~end~0.base)), 11568#true, 11569#false, 11570#(= (select |#valid| main_~list~0.base) 1), 11571#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 11572#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 11573#(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)))), 11574#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 11575#(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)), 11576#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11577#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 11578#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 11579#(and (= |main_#t~mem6.base| (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~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 11580#(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))) (= 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)) (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)))), 11581#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= (select |#valid| main_~end~0.base) 1)), 11582#(= 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)))), 11583#(= 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))))] [2018-02-02 10:32:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:01,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:01,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:01,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:01,317 INFO L87 Difference]: Start difference. First operand 237 states and 254 transitions. Second operand 20 states. [2018-02-02 10:32:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:02,146 INFO L93 Difference]: Finished difference Result 299 states and 320 transitions. [2018-02-02 10:32:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:32:02,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 10:32:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:02,147 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:32:02,147 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:32:02,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:32:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:32:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 244. [2018-02-02 10:32:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:32:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-02-02 10:32:02,150 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 58 [2018-02-02 10:32:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:02,150 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-02-02 10:32:02,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-02-02 10:32:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:02,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:02,151 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:02,151 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash 831255618, now seen corresponding path program 3 times [2018-02-02 10:32:02,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:02,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:02,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:02,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:32:02,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:02,426 INFO L134 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:32:02,426 INFO L182 omatonBuilderFactory]: Interpolants [12167#true, 12168#false, 12169#(= (select |#valid| main_~list~0.base) 1), 12170#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 12171#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 12172#(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)))), 12173#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 12174#(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)), 12175#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 12176#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 12177#(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)) (= 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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 12178#(and (= 8 (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)))) (= 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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 12179#(and (= 8 (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)))) (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))) (= 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)))), 12180#(and (= 8 (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)))) (= 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)))), 12181#(and (= 8 (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)))) (= 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)))), 12182#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 12183#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 12184#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 12185#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:32:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:02,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:32:02,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:32:02,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:32:02,427 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 19 states. [2018-02-02 10:32:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:03,400 INFO L93 Difference]: Finished difference Result 305 states and 327 transitions. [2018-02-02 10:32:03,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:03,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-02-02 10:32:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:03,401 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:32:03,401 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:32:03,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:32:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 239. [2018-02-02 10:32:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:32:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 257 transitions. [2018-02-02 10:32:03,403 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 257 transitions. Word has length 58 [2018-02-02 10:32:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:03,403 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 257 transitions. [2018-02-02 10:32:03,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:32:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 257 transitions. [2018-02-02 10:32:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:03,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:03,404 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:03,404 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:03,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1552541470, now seen corresponding path program 1 times [2018-02-02 10:32:03,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:03,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:03,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:03,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:03,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:03,929 INFO L134 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:32:03,930 INFO L182 omatonBuilderFactory]: Interpolants [12768#(and (= main_~list~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 12769#(and (= main_~list~0.offset 0) (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)))), 12770#(and (or (= |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 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 |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset)))) (= main_~list~0.offset |main_#t~malloc11.offset|)), 12771#(and (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 12772#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset |main_#t~mem13.offset|)), 12773#(or (and (not (= main_~end~0.base main_~list~0.base)) (or (= 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)) (= 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))))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 12774#(or (and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (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)))), 12775#(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)))), 12776#(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)))), 12777#(or (= 1 (select |#valid| |main_#t~mem20.base|)) (and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|))), 12778#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 12779#(= 1 (select |#valid| main_~end~0.base)), 12756#true, 12757#false, 12758#(= |main_#t~malloc0.offset| 0), 12759#(= main_~list~0.offset 0), 12760#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 12761#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 12762#(and (= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)), 12763#(and (= main_~list~0.offset 0) (= 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)))), 12764#(and (= main_~list~0.offset 0) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 12765#(and (= main_~list~0.offset 0) (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)), 12766#(and (= main_~list~0.offset 0) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 12767#(and (= main_~list~0.offset 0) (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))] [2018-02-02 10:32:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:03,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:03,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:03,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:03,930 INFO L87 Difference]: Start difference. First operand 239 states and 257 transitions. Second operand 24 states. [2018-02-02 10:32:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:05,545 INFO L93 Difference]: Finished difference Result 330 states and 354 transitions. [2018-02-02 10:32:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:32:05,545 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:32:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:05,546 INFO L225 Difference]: With dead ends: 330 [2018-02-02 10:32:05,546 INFO L226 Difference]: Without dead ends: 330 [2018-02-02 10:32:05,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=912, Invalid=3120, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:32:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-02 10:32:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 266. [2018-02-02 10:32:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 10:32:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 287 transitions. [2018-02-02 10:32:05,550 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 287 transitions. Word has length 58 [2018-02-02 10:32:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:05,550 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 287 transitions. [2018-02-02 10:32:05,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 287 transitions. [2018-02-02 10:32:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:05,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:05,551 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:05,551 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1552541469, now seen corresponding path program 1 times [2018-02-02 10:32:05,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:05,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:06,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:06,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:32:06,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:06,198 INFO L134 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:32:06,198 INFO L182 omatonBuilderFactory]: Interpolants [13456#true, 13457#false, 13458#(= |main_#t~malloc0.offset| 0), 13459#(= main_~list~0.offset 0), 13460#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 13461#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 13462#(and (= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 13463#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset 0) (= 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)))), 13464#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 13465#(and (= main_~list~0.offset 0) (= 8 (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))) (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)), 13466#(and (= main_~list~0.offset 0) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (= (select |#length| main_~end~0.base) 8) (= 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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 13467#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select |#length| main_~end~0.base) 8) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 13468#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 13469#(and (= main_~list~0.offset 0) (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)) (<= 8 (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))) (= (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)) 1)), 13470#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 13471#(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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (<= 8 (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 |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset |main_#t~malloc11.offset|)), 13472#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 13473#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset |main_#t~mem13.offset|)), 13474#(and (or (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))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))) (or (<= 8 (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))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 13475#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (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 (not (= main_~end~0.base main_~list~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))))), 13476#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (or (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 13477#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 13478#(and (= 0 |main_#t~mem20.offset|) (or (= 0 |main_#t~mem20.base|) (<= 8 (select |#length| |main_#t~mem20.base|)))), 13479#(and (= main_~end~0.offset 0) (or (= main_~end~0.base 0) (<= 8 (select |#length| main_~end~0.base)))), 13480#(and (= main_~end~0.offset 0) (<= 8 (select |#length| main_~end~0.base)))] [2018-02-02 10:32:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:06,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:06,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:06,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:06,199 INFO L87 Difference]: Start difference. First operand 266 states and 287 transitions. Second operand 25 states. [2018-02-02 10:32:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:07,881 INFO L93 Difference]: Finished difference Result 346 states and 371 transitions. [2018-02-02 10:32:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 10:32:07,882 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2018-02-02 10:32:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:07,883 INFO L225 Difference]: With dead ends: 346 [2018-02-02 10:32:07,883 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:32:07,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=954, Invalid=3602, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:32:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:32:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 265. [2018-02-02 10:32:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:32:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 285 transitions. [2018-02-02 10:32:07,886 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 285 transitions. Word has length 58 [2018-02-02 10:32:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:07,886 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 285 transitions. [2018-02-02 10:32:07,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 285 transitions. [2018-02-02 10:32:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:07,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:07,887 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:32:07,887 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:07,887 INFO L82 PathProgramCache]: Analyzing trace with hash 951584074, now seen corresponding path program 1 times [2018-02-02 10:32:07,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:07,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:08,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:08,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:32:08,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:08,026 INFO L134 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:32:08,026 INFO L182 omatonBuilderFactory]: Interpolants [14178#true, 14179#false, 14180#(= (select |#valid| main_~list~0.base) 1), 14181#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base) (= (select |#valid| main_~end~0.base) 1)), 14182#(and (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0))), 14183#(and (= main_~end~0.base main_~list~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (= (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)))), 14184#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 14185#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1) (not (= (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))), 14186#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (not (= (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~malloc11.base|)) main_~list~0.base) main_~list~0.offset) 0))), 14187#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 14188#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~mem13.base|))), 14189#(and (not (= main_~end~0.base main_~list~0.base)) (not (= (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))), 14190#(not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)), 14191#(not (= |main_#t~mem24.base| 0)), 14192#(not (= main_~end~0.base 0)), 14193#(not (= main_~list~0.base 0))] [2018-02-02 10:32:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:08,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:08,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:08,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:08,027 INFO L87 Difference]: Start difference. First operand 265 states and 285 transitions. Second operand 16 states. [2018-02-02 10:32:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:08,514 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2018-02-02 10:32:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:32:08,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 10:32:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:08,520 INFO L225 Difference]: With dead ends: 338 [2018-02-02 10:32:08,520 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 10:32:08,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:32:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 10:32:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 265. [2018-02-02 10:32:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 10:32:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 284 transitions. [2018-02-02 10:32:08,522 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 284 transitions. Word has length 58 [2018-02-02 10:32:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:08,522 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 284 transitions. [2018-02-02 10:32:08,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 284 transitions. [2018-02-02 10:32:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:08,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:08,523 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:08,523 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1148661300, now seen corresponding path program 2 times [2018-02-02 10:32:08,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:08,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:08,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:32:08,791 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,791 INFO L182 omatonBuilderFactory]: Interpolants [14825#true, 14826#false, 14827#(= (select |#valid| main_~list~0.base) 1), 14828#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 14829#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 14830#(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)))), 14831#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 14832#(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)), 14833#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 14834#(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)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 14835#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 14836#(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))) (= (select |#valid| main_~list~0.base) 1)), 14837#(and (or (= 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 |main_#t~malloc4.base|)) main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc4.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~malloc4.base|)) main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~malloc4.base|))), 14838#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 14839#(and (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base |main_#t~mem6.base|))), 14840#(and (not (= main_~end~0.base main_~list~0.base)) (or (= 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)) (= 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))))), 14841#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 14842#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 14843#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 14844#(= 1 (select |#valid| |main_#t~mem20.base|)), 14845#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:08,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:32:08,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:32:08,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:08,792 INFO L87 Difference]: Start difference. First operand 265 states and 284 transitions. Second operand 21 states. [2018-02-02 10:32:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:09,652 INFO L93 Difference]: Finished difference Result 377 states and 406 transitions. [2018-02-02 10:32:09,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:32:09,652 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 10:32:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:09,653 INFO L225 Difference]: With dead ends: 377 [2018-02-02 10:32:09,653 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 10:32:09,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=446, Invalid=1810, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:32:09,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 10:32:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 293. [2018-02-02 10:32:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 10:32:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 316 transitions. [2018-02-02 10:32:09,655 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 316 transitions. Word has length 58 [2018-02-02 10:32:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:09,656 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 316 transitions. [2018-02-02 10:32:09,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:32:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 316 transitions. [2018-02-02 10:32:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:32:09,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:09,657 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:09,657 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1148661301, now seen corresponding path program 2 times [2018-02-02 10:32:09,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:09,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:10,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:10,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:10,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:10,100 INFO L134 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:32:10,100 INFO L182 omatonBuilderFactory]: Interpolants [15584#(and (= main_~list~0.offset 0) (= 8 (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))) (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)) (= (select |#valid| 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)) 1)), 15585#(and (= 8 (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 |main_#t~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= main_~list~0.offset |main_#t~malloc4.offset|)), 15586#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| 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_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 15587#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset |main_#t~mem6.offset|) (not (= main_~list~0.base |main_#t~mem6.base|))), 15588#(and (= 8 (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))) (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))), 15589#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 15590#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~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))), 15591#(and (= 0 |main_#t~mem20.offset|) (or (= 0 |main_#t~mem20.base|) (= 8 (select |#length| |main_#t~mem20.base|)))), 15592#(and (= main_~end~0.offset 0) (or (= (select |#length| main_~end~0.base) 8) (= main_~end~0.base 0))), 15593#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 15570#true, 15571#false, 15572#(= |main_#t~malloc0.offset| 0), 15573#(= main_~list~0.offset 0), 15574#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 15575#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 15576#(and (= main_~list~0.offset 0) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15577#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset 0) (= 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)))), 15578#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 15579#(and (= main_~list~0.offset 0) (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) (= 8 (select |#length| main_~end~0.base))), 15580#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 15581#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 15582#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (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) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 15583#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|)))] [2018-02-02 10:32:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:10,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:10,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:10,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:10,101 INFO L87 Difference]: Start difference. First operand 293 states and 316 transitions. Second operand 24 states. [2018-02-02 10:32:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:11,382 INFO L93 Difference]: Finished difference Result 347 states and 373 transitions. [2018-02-02 10:32:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:32:11,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 10:32:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:11,383 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:32:11,383 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:32:11,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=546, Invalid=2106, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:32:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:32:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 276. [2018-02-02 10:32:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 10:32:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 297 transitions. [2018-02-02 10:32:11,386 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 297 transitions. Word has length 58 [2018-02-02 10:32:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:11,386 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 297 transitions. [2018-02-02 10:32:11,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 297 transitions. [2018-02-02 10:32:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:32:11,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:11,387 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2018-02-02 10:32:11,387 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1717352075, now seen corresponding path program 3 times [2018-02-02 10:32:11,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:11,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:11,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:11,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,689 INFO L182 omatonBuilderFactory]: Interpolants [16288#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 16289#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 16290#(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)))), 16291#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 16292#(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))), 16293#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 16294#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 16273#true, 16274#false, 16275#(= (select |#valid| main_~list~0.base) 1), 16276#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 16277#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 16278#(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)))), 16279#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 16280#(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)), 16281#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16282#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 16283#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 16284#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= (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)) |main_#t~mem13.offset|) (= (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)) |main_#t~mem13.base|) (not (= main_~list~0.base |main_#t~mem13.base|))), 16285#(and (not (= main_~end~0.base main_~list~0.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 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))) (= 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)) (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)))), 16286#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 16287#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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)))))] [2018-02-02 10:32:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:11,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:11,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:11,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:11,690 INFO L87 Difference]: Start difference. First operand 276 states and 297 transitions. Second operand 22 states. [2018-02-02 10:32:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:12,671 INFO L93 Difference]: Finished difference Result 328 states and 353 transitions. [2018-02-02 10:32:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:12,672 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-02-02 10:32:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:12,673 INFO L225 Difference]: With dead ends: 328 [2018-02-02 10:32:12,673 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 10:32:12,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:32:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 10:32:12,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 286. [2018-02-02 10:32:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 10:32:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 309 transitions. [2018-02-02 10:32:12,676 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 309 transitions. Word has length 59 [2018-02-02 10:32:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:12,676 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 309 transitions. [2018-02-02 10:32:12,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 309 transitions. [2018-02-02 10:32:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:32:12,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:12,676 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:12,676 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:12,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1953723227, now seen corresponding path program 2 times [2018-02-02 10:32:12,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:12,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:12,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:12,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:12,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:12,886 INFO L182 omatonBuilderFactory]: Interpolants [16960#(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)))), 16961#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 16962#(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)), 16963#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16964#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 16965#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 16966#(and (= |main_#t~mem6.base| (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~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 16967#(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))) (= 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)) (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)))), 16968#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= (select |#valid| main_~end~0.base) 1)), 16969#(= 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)))), 16970#(= 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)))), 16971#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 16972#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 16973#(= 1 (select |#valid| |main_#t~mem18.base|)), 16974#(= 1 (select |#valid| main_~end~0.base)), 16955#true, 16956#false, 16957#(= (select |#valid| main_~list~0.base) 1), 16958#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 16959#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset))] [2018-02-02 10:32:12,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:12,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:12,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:12,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:12,887 INFO L87 Difference]: Start difference. First operand 286 states and 309 transitions. Second operand 20 states. [2018-02-02 10:32:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:13,704 INFO L93 Difference]: Finished difference Result 338 states and 364 transitions. [2018-02-02 10:32:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:32:13,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-02 10:32:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:13,705 INFO L225 Difference]: With dead ends: 338 [2018-02-02 10:32:13,705 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 10:32:13,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:32:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 10:32:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 293. [2018-02-02 10:32:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 10:32:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 317 transitions. [2018-02-02 10:32:13,707 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 317 transitions. Word has length 60 [2018-02-02 10:32:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:13,707 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 317 transitions. [2018-02-02 10:32:13,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 317 transitions. [2018-02-02 10:32:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:32:13,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:13,708 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:13,708 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1953723226, now seen corresponding path program 1 times [2018-02-02 10:32:13,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:13,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:14,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:14,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:32:14,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:14,013 INFO L134 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:32:14,013 INFO L182 omatonBuilderFactory]: Interpolants [17640#true, 17641#false, 17642#(= (select |#valid| main_~list~0.base) 1), 17643#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 17644#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 17645#(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)))), 17646#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 17647#(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)), 17648#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 17649#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 17650#(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)) (= 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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 17651#(and (= 8 (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)))) (= 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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 17652#(and (= 8 (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)))) (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))) (= 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)))), 17653#(and (= 8 (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)))) (= 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)))), 17654#(and (= 8 (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)))) (= 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)))), 17655#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 17656#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 17657#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 17658#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:32:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:14,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:32:14,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:32:14,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:32:14,014 INFO L87 Difference]: Start difference. First operand 293 states and 317 transitions. Second operand 19 states. [2018-02-02 10:32:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:14,826 INFO L93 Difference]: Finished difference Result 343 states and 369 transitions. [2018-02-02 10:32:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:14,826 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 10:32:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:14,827 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:32:14,827 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:32:14,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:32:14,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 286. [2018-02-02 10:32:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 10:32:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 309 transitions. [2018-02-02 10:32:14,829 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 309 transitions. Word has length 60 [2018-02-02 10:32:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:14,829 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 309 transitions. [2018-02-02 10:32:14,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:32:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 309 transitions. [2018-02-02 10:32:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:32:14,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:14,830 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:14,830 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1260610777, now seen corresponding path program 2 times [2018-02-02 10:32:14,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:14,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:15,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:15,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:15,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:15,195 INFO L134 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:32:15,195 INFO L182 omatonBuilderFactory]: Interpolants [18314#true, 18315#false, 18316#(= (select |#valid| main_~list~0.base) 1), 18317#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 18318#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 18319#(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)))), 18320#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 18321#(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)), 18322#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 18323#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 18324#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 18325#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= (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)) |main_#t~mem13.offset|) (= (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)) |main_#t~mem13.base|) (not (= main_~list~0.base |main_#t~mem13.base|))), 18326#(and (not (= main_~end~0.base main_~list~0.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 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))) (= 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)) (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)))), 18327#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 18328#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 18329#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 18330#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 18331#(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)))), 18332#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 18333#(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))), 18334#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 18335#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 10:32:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:15,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:15,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:15,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:15,196 INFO L87 Difference]: Start difference. First operand 286 states and 309 transitions. Second operand 22 states. [2018-02-02 10:32:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:16,174 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-02-02 10:32:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:32:16,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 10:32:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:16,175 INFO L225 Difference]: With dead ends: 339 [2018-02-02 10:32:16,175 INFO L226 Difference]: Without dead ends: 335 [2018-02-02 10:32:16,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:32:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-02 10:32:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 286. [2018-02-02 10:32:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 10:32:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 308 transitions. [2018-02-02 10:32:16,177 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 308 transitions. Word has length 61 [2018-02-02 10:32:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:16,177 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 308 transitions. [2018-02-02 10:32:16,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 308 transitions. [2018-02-02 10:32:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:16,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:16,178 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:16,178 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -119354089, now seen corresponding path program 1 times [2018-02-02 10:32:16,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:16,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:17,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:17,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:32:17,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:17,062 INFO L134 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:32:17,063 INFO L182 omatonBuilderFactory]: Interpolants [19008#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 19009#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (select |#valid| 0) 0)), 19010#(and (= main_~list~0.offset 0) (= 1 (select |#valid| main_~list~0.base)) (= (select |#valid| 0) 0)), 19011#(and (= main_~list~0.offset 0) (= main_~list~0.offset main_~end~0.offset) (= main_~end~0.base main_~list~0.base) (= (select |#valid| 0) 0) (= 1 (select |#valid| main_~end~0.base))), 19012#(and (= main_~list~0.offset 0) (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= (select |#valid| 0) 0) (= 0 |main_#t~malloc4.offset|)), 19013#(and (= main_~list~0.offset 0) (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= (select |#valid| 0) 0) (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))), 19014#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= (select |#valid| 0) 0) (= 0 |main_#t~mem6.offset|) (not (= main_~list~0.base |main_#t~mem6.base|))), 19015#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (or (and (< main_~end~0.offset (+ main_~list~0.offset 1)) (or (= 1 (select |#valid| 0)) (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))), 19016#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (<= 0 main_~end~0.offset) (< main_~end~0.offset (+ main_~list~0.offset 1)) (or (= 1 (select |#valid| 0)) (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| 0) 0)))), 19017#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19018#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select |#memory_$Pointer$.offset| main_~list~0.base) (select |#memory_$Pointer$.offset| main_~end~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19019#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19020#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4))))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19021#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (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)) |main_#t~mem20.base|) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19022#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= (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)) main_~end~0.base) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19023#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= 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))) (or (= 1 (select |#valid| 0)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4)))))), 19024#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (or (and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4))) (= (select (store |#valid| main_~list~0.base 0) 0) 0)) (= 1 (select (store |#valid| main_~list~0.base 0) 0)))), 19025#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (or (= 1 (select (store |#valid| main_~list~0.base 0) 0)) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 4))) (= (select (store |#valid| main_~list~0.base 0) 0) 0)))), 19026#(and (or (= 1 (select |#valid| 0)) (and (= 1 (select (select |#memory_int| main_~end~0.base) (+ 0 4))) (= (select |#valid| 0) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 19027#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (and (= 1 (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select |#valid| 0) 0)) (<= 1 main_~list~0.offset) (= 1 (select |#valid| 0)) (<= (+ main_~list~0.offset 1) 0))), 19028#(or (not (= main_~list~0.offset 0)) (and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) 0)) (and (= 1 (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (store |#valid| main_~list~0.base 0) 0) 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 19029#(or (not (= main_~list~0.offset 0)) (and (not (= 0 main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (and (= 1 |main_#t~mem21|) (= (select (store |#valid| main_~list~0.base 0) 0) 0)) (= 1 (select (store |#valid| main_~list~0.base 0) 0))))), 19030#(or (not (= main_~list~0.offset 0)) (and (= 1 (select (store |#valid| main_~list~0.base 0) 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 19031#(or (and (= 0 |main_#t~mem22.base|) (= 1 (select (store |#valid| main_~list~0.base 0) 0))) (not (= main_~list~0.offset 0))), 19032#(or (not (= main_~list~0.offset 0)) (and (= 0 main_~end~0.base) (= 1 (select (store |#valid| main_~list~0.base 0) 0)))), 19033#(= 1 (select |#valid| main_~end~0.base)), 19005#true, 19006#false, 19007#(= (select |#valid| 0) 0)] [2018-02-02 10:32:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:17,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:32:17,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:32:17,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:17,063 INFO L87 Difference]: Start difference. First operand 286 states and 308 transitions. Second operand 29 states. [2018-02-02 10:32:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:18,292 INFO L93 Difference]: Finished difference Result 287 states and 308 transitions. [2018-02-02 10:32:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:32:18,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-02-02 10:32:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:18,294 INFO L225 Difference]: With dead ends: 287 [2018-02-02 10:32:18,294 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 10:32:18,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=437, Invalid=2985, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:32:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 10:32:18,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-02-02 10:32:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 10:32:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 304 transitions. [2018-02-02 10:32:18,299 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 304 transitions. Word has length 62 [2018-02-02 10:32:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:18,299 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 304 transitions. [2018-02-02 10:32:18,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:32:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 304 transitions. [2018-02-02 10:32:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:18,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:18,300 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:18,300 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2094318639, now seen corresponding path program 1 times [2018-02-02 10:32:18,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:18,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:18,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:18,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,603 INFO L182 omatonBuilderFactory]: Interpolants [19680#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 19681#(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)))), 19682#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 19683#(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))), 19684#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 19685#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 19664#true, 19665#false, 19666#(= (select |#valid| main_~list~0.base) 1), 19667#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 19668#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 19669#(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)))), 19670#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 19671#(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)), 19672#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19673#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))), 19674#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 19675#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= (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)) |main_#t~mem13.offset|) (= (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)) |main_#t~mem13.base|) (not (= main_~list~0.base |main_#t~mem13.base|))), 19676#(and (not (= main_~end~0.base main_~list~0.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 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))) (= 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)) (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)))), 19677#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 19678#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 19679#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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)))))] [2018-02-02 10:32:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:18,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:18,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:18,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:18,604 INFO L87 Difference]: Start difference. First operand 283 states and 304 transitions. Second operand 22 states. [2018-02-02 10:32:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:19,436 INFO L93 Difference]: Finished difference Result 308 states and 329 transitions. [2018-02-02 10:32:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:32:19,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-02-02 10:32:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:19,437 INFO L225 Difference]: With dead ends: 308 [2018-02-02 10:32:19,437 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 10:32:19,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=1532, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:32:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 10:32:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 292. [2018-02-02 10:32:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 10:32:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 313 transitions. [2018-02-02 10:32:19,440 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 313 transitions. Word has length 62 [2018-02-02 10:32:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:19,440 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 313 transitions. [2018-02-02 10:32:19,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 313 transitions. [2018-02-02 10:32:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:32:19,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:19,441 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:19,441 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2027711640, now seen corresponding path program 3 times [2018-02-02 10:32:19,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:19,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:19,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:19,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:32:19,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:19,599 INFO L134 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:32:19,599 INFO L182 omatonBuilderFactory]: Interpolants [20326#true, 20327#false, 20328#(= (select |#valid| main_~list~0.base) 1), 20329#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 20330#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (not (= |main_#t~malloc4.base| 0))), 20331#(and (= main_~end~0.base main_~list~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (= (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)))), 20332#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 20333#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1) (not (= (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))), 20334#(and (not (= (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~malloc4.base|)) main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 20335#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 20336#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base |main_#t~mem6.base|))), 20337#(and (not (= main_~end~0.base main_~list~0.base)) (not (= (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))), 20338#(not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)), 20339#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)), 20340#(not (= |main_#t~mem20.base| 0)), 20341#(not (= main_~end~0.base 0))] [2018-02-02 10:32:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:19,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:19,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:19,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:19,599 INFO L87 Difference]: Start difference. First operand 292 states and 313 transitions. Second operand 16 states. [2018-02-02 10:32:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:20,055 INFO L93 Difference]: Finished difference Result 364 states and 390 transitions. [2018-02-02 10:32:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:32:20,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-02-02 10:32:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:20,057 INFO L225 Difference]: With dead ends: 364 [2018-02-02 10:32:20,057 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 10:32:20,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:32:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 10:32:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 319. [2018-02-02 10:32:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 10:32:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 341 transitions. [2018-02-02 10:32:20,060 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 341 transitions. Word has length 63 [2018-02-02 10:32:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:20,060 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 341 transitions. [2018-02-02 10:32:20,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 341 transitions. [2018-02-02 10:32:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:32:20,061 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:20,061 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:20,061 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1257855219, now seen corresponding path program 1 times [2018-02-02 10:32:20,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:20,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:20,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:20,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:32:20,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:20,426 INFO L134 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:32:20,426 INFO L182 omatonBuilderFactory]: Interpolants [21056#(and (not (= 0 main_~list~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 21057#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset) (not (= main_~list~0.base |main_#t~mem13.base|))), 21058#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= (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) main_~list~0.offset)), 21059#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset)), 21060#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 21061#(and (not (= 0 main_~list~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) |main_#t~mem20.offset|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.base|)), 21062#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= 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)))), 21063#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (= main_~end~0.base main_~list~0.base) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))))), 21064#(and (not (= 0 main_~list~0.base)) (or (not (= 0 |main_#t~mem20.base|)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 21065#(and (not (= 0 main_~list~0.base)) (or (not (= 0 main_~end~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 21066#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 21067#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem24.base|))), 21068#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 21069#(= 1 (select |#valid| main_~end~0.base)), 21070#(= 1 (select |#valid| main_~list~0.base)), 21045#true, 21046#false, 21047#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 21048#(and (not (= 0 main_~list~0.base)) (= 0 main_~list~0.offset)), 21049#(and (not (= 0 main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~list~0.offset)), 21050#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 21051#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc4.offset| main_~list~0.offset)), 21052#(and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~list~0.offset) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~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)))), 21053#(and (not (= 0 main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~list~0.offset) (not (= main_~list~0.base |main_#t~mem6.base|))), 21054#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (= (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) main_~list~0.offset)), 21055#(and (not (= 0 main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc11.base|)) (= (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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset) main_~list~0.offset))] [2018-02-02 10:32:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:20,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:32:20,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:32:20,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:32:20,427 INFO L87 Difference]: Start difference. First operand 319 states and 341 transitions. Second operand 26 states. [2018-02-02 10:32:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:21,507 INFO L93 Difference]: Finished difference Result 357 states and 381 transitions. [2018-02-02 10:32:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:32:21,508 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-02-02 10:32:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:21,509 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:32:21,509 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 10:32:21,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=647, Invalid=2659, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:32:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 10:32:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2018-02-02 10:32:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:32:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 353 transitions. [2018-02-02 10:32:21,512 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 353 transitions. Word has length 63 [2018-02-02 10:32:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:21,512 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 353 transitions. [2018-02-02 10:32:21,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:32:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 353 transitions. [2018-02-02 10:32:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:32:21,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:21,512 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:21,512 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1257855218, now seen corresponding path program 1 times [2018-02-02 10:32:21,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:21,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:21,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:21,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:21,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:21,580 INFO L182 omatonBuilderFactory]: Interpolants [21824#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 21825#(and (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem20.base|)), 21826#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21827#(and (<= (+ main_~end~0.offset 8) (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21828#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21829#(and (<= 0 |main_#t~mem24.offset|) (<= (+ |main_#t~mem24.offset| 8) (select |#length| |main_#t~mem24.base|))), 21830#(and (<= (+ main_~end~0.offset 8) (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset)), 21831#(and (<= (+ main_~list~0.offset 8) (select |#length| main_~list~0.base)) (<= 0 main_~list~0.offset)), 21822#true, 21823#false] [2018-02-02 10:32:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:21,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:32:21,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:32:21,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:21,581 INFO L87 Difference]: Start difference. First operand 330 states and 353 transitions. Second operand 10 states. [2018-02-02 10:32:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:21,799 INFO L93 Difference]: Finished difference Result 375 states and 401 transitions. [2018-02-02 10:32:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:21,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:32:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:21,800 INFO L225 Difference]: With dead ends: 375 [2018-02-02 10:32:21,800 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 10:32:21,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 10:32:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 334. [2018-02-02 10:32:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:32:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 358 transitions. [2018-02-02 10:32:21,803 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 358 transitions. Word has length 63 [2018-02-02 10:32:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:21,803 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 358 transitions. [2018-02-02 10:32:21,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:32:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 358 transitions. [2018-02-02 10:32:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:21,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:21,803 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:21,803 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1577831399, now seen corresponding path program 5 times [2018-02-02 10:32:21,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:21,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:22,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:22,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:22,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:22,202 INFO L134 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:32:22,203 INFO L182 omatonBuilderFactory]: Interpolants [22560#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 22561#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 22562#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (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)) |main_#t~mem6.offset|) (= (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)) |main_#t~mem6.base|)), 22563#(and (not (= main_~end~0.base main_~list~0.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 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))) (= 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)) (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)))), 22564#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 22565#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 22566#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 22567#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 22568#(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)))), 22569#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 22570#(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))), 22571#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 22572#(and (= main_~end~0.offset 0) (= main_~end~0.base 0)), 22551#true, 22552#false, 22553#(= (select |#valid| main_~list~0.base) 1), 22554#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 22555#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 22556#(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)))), 22557#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 22558#(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)), 22559#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))] [2018-02-02 10:32:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:22,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:22,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:22,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:22,203 INFO L87 Difference]: Start difference. First operand 334 states and 358 transitions. Second operand 22 states. [2018-02-02 10:32:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:23,265 INFO L93 Difference]: Finished difference Result 382 states and 409 transitions. [2018-02-02 10:32:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:23,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-02-02 10:32:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:23,266 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:32:23,266 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:32:23,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:32:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:32:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 336. [2018-02-02 10:32:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 10:32:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 361 transitions. [2018-02-02 10:32:23,270 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 361 transitions. Word has length 64 [2018-02-02 10:32:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:23,270 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 361 transitions. [2018-02-02 10:32:23,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 361 transitions. [2018-02-02 10:32:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:23,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:23,271 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:23,271 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash -577358904, now seen corresponding path program 3 times [2018-02-02 10:32:23,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:23,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:23,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:23,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,586 INFO L182 omatonBuilderFactory]: Interpolants [23337#true, 23338#false, 23339#(= (select |#valid| main_~list~0.base) 1), 23340#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 23341#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 23342#(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)))), 23343#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 23344#(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)), 23345#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 23346#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~list~0.base) 1)), 23347#(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))) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 23348#(and (= |main_#t~mem6.base| (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))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 23349#(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))) (= 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)) (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))) (= (select |#valid| 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)) 1)), 23350#(and (not (= (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~malloc11.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc11.base|)) (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)))), 23351#(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| (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) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 23352#(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~mem13.base|)) (not (= main_~list~0.base |main_#t~mem13.base|))), 23353#(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)))), 23354#(= 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)))), 23355#(= 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)))), 23356#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 23357#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 23358#(= 1 (select |#valid| |main_#t~mem20.base|)), 23359#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:23,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:32:23,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:32:23,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:23,586 INFO L87 Difference]: Start difference. First operand 336 states and 361 transitions. Second operand 23 states. [2018-02-02 10:32:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:24,744 INFO L93 Difference]: Finished difference Result 419 states and 449 transitions. [2018-02-02 10:32:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:32:24,744 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-02 10:32:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:24,745 INFO L225 Difference]: With dead ends: 419 [2018-02-02 10:32:24,745 INFO L226 Difference]: Without dead ends: 419 [2018-02-02 10:32:24,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:32:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-02 10:32:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2018-02-02 10:32:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:32:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 388 transitions. [2018-02-02 10:32:24,749 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 388 transitions. Word has length 64 [2018-02-02 10:32:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:24,749 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 388 transitions. [2018-02-02 10:32:24,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:32:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 388 transitions. [2018-02-02 10:32:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:24,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:24,750 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:24,751 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -577358903, now seen corresponding path program 3 times [2018-02-02 10:32:24,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:24,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:25,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:25,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:25,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:25,252 INFO L134 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:32:25,252 INFO L182 omatonBuilderFactory]: Interpolants [24192#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 24193#(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)), 24194#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 24195#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~list~0.base) 1) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 24196#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~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))) (= (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))) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 24197#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (= 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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= (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)) |main_#t~mem6.base|)), 24198#(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))) (= 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)) (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))) (= (select |#valid| 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)) 1) (= 8 (select |#length| main_~end~0.base))), 24199#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 24200#(and (not (= (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~malloc11.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc11.base|)) (not (= main_~list~0.base |main_#t~malloc11.base|)) (= (select |#length| main_~end~0.base) 8) (= 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~malloc11.offset|)) (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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset))) (= 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~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)))), 24201#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select |#length| main_~end~0.base) 8) (= main_~end~0.base (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) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~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)))), 24202#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.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))) (<= 8 (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)))) (not (= main_~list~0.base |main_#t~mem13.base|))), 24203#(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))) (<= 8 (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)))), 24204#(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))) (<= 8 (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))))), 24205#(and (<= 8 (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)))) (= 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)))), 24206#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 24207#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 24208#(and (= 0 |main_#t~mem20.offset|) (<= 8 (select |#length| |main_#t~mem20.base|))), 24209#(and (= main_~end~0.offset 0) (<= 8 (select |#length| main_~end~0.base))), 24186#true, 24187#false, 24188#(= (select |#valid| main_~list~0.base) 1), 24189#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 24190#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 24191#(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))))] [2018-02-02 10:32:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:25,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:25,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:25,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:25,253 INFO L87 Difference]: Start difference. First operand 359 states and 388 transitions. Second operand 24 states. [2018-02-02 10:32:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,621 INFO L93 Difference]: Finished difference Result 425 states and 456 transitions. [2018-02-02 10:32:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:32:26,621 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-02-02 10:32:26,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,622 INFO L225 Difference]: With dead ends: 425 [2018-02-02 10:32:26,622 INFO L226 Difference]: Without dead ends: 425 [2018-02-02 10:32:26,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:32:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-02 10:32:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 358. [2018-02-02 10:32:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 10:32:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 386 transitions. [2018-02-02 10:32:26,625 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 386 transitions. Word has length 64 [2018-02-02 10:32:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,625 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 386 transitions. [2018-02-02 10:32:26,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 386 transitions. [2018-02-02 10:32:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:26,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,626 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:26,626 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash -831356006, now seen corresponding path program 4 times [2018-02-02 10:32:26,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:26,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:26,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,934 INFO L182 omatonBuilderFactory]: Interpolants [25025#true, 25026#false, 25027#(= (select |#valid| main_~list~0.base) 1), 25028#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 25029#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 25030#(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)))), 25031#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 25032#(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)), 25033#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 25034#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 25035#(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))) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 25036#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= |main_#t~mem13.base| (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))) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 25037#(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))) (= 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)) (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))) (= (select |#valid| 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)) 1)), 25038#(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 |main_#t~malloc4.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~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset))) (not (= (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~malloc4.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 25039#(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| (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) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 25040#(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~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 25041#(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)))), 25042#(= 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)))), 25043#(= 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)))), 25044#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 25045#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 25046#(= 1 (select |#valid| |main_#t~mem20.base|)), 25047#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:32:26,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:32:26,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:26,935 INFO L87 Difference]: Start difference. First operand 358 states and 386 transitions. Second operand 23 states. [2018-02-02 10:32:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:28,118 INFO L93 Difference]: Finished difference Result 451 states and 486 transitions. [2018-02-02 10:32:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:32:28,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-02-02 10:32:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:28,119 INFO L225 Difference]: With dead ends: 451 [2018-02-02 10:32:28,119 INFO L226 Difference]: Without dead ends: 451 [2018-02-02 10:32:28,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:32:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-02-02 10:32:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 392. [2018-02-02 10:32:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-02-02 10:32:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 426 transitions. [2018-02-02 10:32:28,123 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 426 transitions. Word has length 64 [2018-02-02 10:32:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:28,124 INFO L432 AbstractCegarLoop]: Abstraction has 392 states and 426 transitions. [2018-02-02 10:32:28,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:32:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 426 transitions. [2018-02-02 10:32:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:28,124 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:28,125 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:28,125 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash -831356005, now seen corresponding path program 4 times [2018-02-02 10:32:28,125 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:28,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:28,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:28,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:28,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:28,661 INFO L134 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:32:28,661 INFO L182 omatonBuilderFactory]: Interpolants [25952#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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))) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 25953#(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 |main_#t~malloc4.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~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset))) (not (= (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~malloc4.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc4.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~malloc4.offset|)) (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~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= 8 (select |#length| main_~end~0.base))), 25954#(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| (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) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~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))) (= 8 (select |#length| main_~end~0.base))), 25955#(and (= 8 (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)))) (= 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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|))), 25956#(and (= 8 (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)))) (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))) (= 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)))), 25957#(and (= 8 (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)))) (= 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)))), 25958#(and (= 8 (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)))) (= 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)))), 25959#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 25960#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 25961#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 25962#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base))), 25939#true, 25940#false, 25941#(= (select |#valid| main_~list~0.base) 1), 25942#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 25943#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 25944#(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)))), 25945#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 25946#(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)), 25947#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 25948#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 0 |main_#t~malloc11.offset|) (not (= main_~end~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~malloc11.base|))), 25949#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~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))) (= (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))) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 25950#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (= 8 (select |#length| |main_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|)) (= |main_#t~mem13.base| (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))) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 25951#(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))) (= 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)) (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))) (= (select |#valid| 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)) 1) (= 8 (select |#length| main_~end~0.base)))] [2018-02-02 10:32:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:28,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:28,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:28,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:28,662 INFO L87 Difference]: Start difference. First operand 392 states and 426 transitions. Second operand 24 states. [2018-02-02 10:32:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:29,854 INFO L93 Difference]: Finished difference Result 459 states and 495 transitions. [2018-02-02 10:32:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:32:29,854 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-02-02 10:32:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:29,855 INFO L225 Difference]: With dead ends: 459 [2018-02-02 10:32:29,855 INFO L226 Difference]: Without dead ends: 459 [2018-02-02 10:32:29,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:32:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-02-02 10:32:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 369. [2018-02-02 10:32:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 10:32:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 399 transitions. [2018-02-02 10:32:29,858 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 399 transitions. Word has length 64 [2018-02-02 10:32:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:29,858 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 399 transitions. [2018-02-02 10:32:29,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 399 transitions. [2018-02-02 10:32:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:29,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:29,859 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-02 10:32:29,859 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1079814203, now seen corresponding path program 4 times [2018-02-02 10:32:29,859 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:29,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:30,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:30,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:32:30,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:30,176 INFO L134 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:32:30,176 INFO L182 omatonBuilderFactory]: Interpolants [26823#true, 26824#false, 26825#(= (select |#valid| main_~list~0.base) 1), 26826#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 26827#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 26828#(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)))), 26829#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 26830#(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)), 26831#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 26832#(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)) (= 1 (select |#valid| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 26833#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 26834#(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))) (= (select |#valid| main_~list~0.base) 1)), 26835#(and (or (= 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 |main_#t~malloc4.base|)) main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc4.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~malloc4.base|)) main_~list~0.base) main_~list~0.offset))) (not (= (select |#valid| main_~list~0.base) 0)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 26836#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select |#valid| main_~list~0.base) 0)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 26837#(and (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (not (= (select |#valid| main_~list~0.base) 0)) (not (= main_~list~0.base |main_#t~mem6.base|))), 26838#(and (not (= main_~end~0.base main_~list~0.base)) (not (= (select |#valid| main_~list~0.base) 0)) (or (= 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)) (= 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))))), 26839#(and (not (= main_~list~0.base |main_#t~malloc11.base|)) (or (= |main_#t~malloc11.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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)) (= 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 |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset))) (= 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~malloc11.base|)) main_~list~0.base) main_~list~0.offset)))), 26840#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 26841#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 26842#(and (not (= main_~end~0.base main_~list~0.base)) (or (= 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)) (= 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))))), 26843#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 26844#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 26845#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 26846#(= 1 (select |#valid| |main_#t~mem20.base|)), 26847#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:30,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:30,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:30,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:30,177 INFO L87 Difference]: Start difference. First operand 369 states and 399 transitions. Second operand 25 states. [2018-02-02 10:32:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:31,728 INFO L93 Difference]: Finished difference Result 417 states and 450 transitions. [2018-02-02 10:32:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:32:31,729 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64 [2018-02-02 10:32:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:31,730 INFO L225 Difference]: With dead ends: 417 [2018-02-02 10:32:31,730 INFO L226 Difference]: Without dead ends: 417 [2018-02-02 10:32:31,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=669, Invalid=3113, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:32:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-02-02 10:32:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 370. [2018-02-02 10:32:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 10:32:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 401 transitions. [2018-02-02 10:32:31,732 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 401 transitions. Word has length 64 [2018-02-02 10:32:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:31,732 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 401 transitions. [2018-02-02 10:32:31,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 401 transitions. [2018-02-02 10:32:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:31,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:31,733 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-02-02 10:32:31,733 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1079814204, now seen corresponding path program 3 times [2018-02-02 10:32:31,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:31,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:32,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:32,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:32:32,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:32,162 INFO L134 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:32:32,162 INFO L182 omatonBuilderFactory]: Interpolants [27712#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 27713#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 27714#(and (= 8 (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)))), 27715#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|))), 27716#(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) (= 8 (select |#length| main_~end~0.base))), 27717#(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)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 27718#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 27719#(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)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 27720#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 27721#(and (= 8 (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))) (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)) (= (select |#valid| 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)) 1)), 27722#(and (= 8 (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 |main_#t~malloc4.base|)) 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 |main_#t~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~list~0.base) 1)), 27723#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| 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))) (= (select |#valid| main_~list~0.base) 1)), 27724#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 27725#(and (= 8 (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))) (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)) (= (select |#valid| main_~list~0.base) 1)), 27726#(and (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (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 |main_#t~malloc11.base|)) main_~list~0.base) main_~list~0.offset)))), 27727#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| 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)))), 27728#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 27729#(and (= 8 (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))) (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))), 27730#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 27731#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 27732#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 27733#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 27709#true, 27710#false, 27711#(= (select |#valid| main_~list~0.base) 1)] [2018-02-02 10:32:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:32,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:32,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:32,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:32,163 INFO L87 Difference]: Start difference. First operand 370 states and 401 transitions. Second operand 25 states. [2018-02-02 10:32:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:33,389 INFO L93 Difference]: Finished difference Result 381 states and 413 transitions. [2018-02-02 10:32:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:32:33,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 64 [2018-02-02 10:32:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:33,390 INFO L225 Difference]: With dead ends: 381 [2018-02-02 10:32:33,390 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 10:32:33,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=1754, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:32:33,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 10:32:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 339. [2018-02-02 10:32:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 10:32:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 365 transitions. [2018-02-02 10:32:33,393 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 365 transitions. Word has length 64 [2018-02-02 10:32:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:33,393 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 365 transitions. [2018-02-02 10:32:33,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:33,393 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 365 transitions. [2018-02-02 10:32:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:32:33,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:33,393 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:33,393 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 164064613, now seen corresponding path program 3 times [2018-02-02 10:32:33,394 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:33,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:33,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:33,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:32:33,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:33,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:32:33,549 INFO L182 omatonBuilderFactory]: Interpolants [28498#true, 28499#false, 28500#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 28501#(and (= |main_#t~mem20.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 28502#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 28503#(and (= (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)) |main_#t~mem20.base|) (= |main_#t~mem20.offset| (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)))), 28504#(and (= main_~end~0.offset (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))) (= (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)) main_~end~0.base)), 28505#(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)))), 28506#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset|))), 28507#(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))), 28508#(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))), 28509#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 28510#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset)), 28511#(and (= main_~list~0.offset 0) (= 0 main_~list~0.base))] [2018-02-02 10:32:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:33,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:32:33,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:32:33,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:32:33,550 INFO L87 Difference]: Start difference. First operand 339 states and 365 transitions. Second operand 14 states. [2018-02-02 10:32:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:33,989 INFO L93 Difference]: Finished difference Result 403 states and 434 transitions. [2018-02-02 10:32:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:32:33,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2018-02-02 10:32:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:33,990 INFO L225 Difference]: With dead ends: 403 [2018-02-02 10:32:33,990 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 10:32:33,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 10:32:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 353. [2018-02-02 10:32:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-02 10:32:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 384 transitions. [2018-02-02 10:32:33,993 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 384 transitions. Word has length 65 [2018-02-02 10:32:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:33,993 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 384 transitions. [2018-02-02 10:32:33,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:32:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 384 transitions. [2018-02-02 10:32:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:32:33,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:33,994 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, 1, 1, 1] [2018-02-02 10:32:33,994 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash 791035020, now seen corresponding path program 4 times [2018-02-02 10:32:33,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:34,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:34,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:34,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:32:34,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:34,433 INFO L134 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:32:34,433 INFO L182 omatonBuilderFactory]: Interpolants [29289#true, 29290#false, 29291#(= |#valid| |old(#valid)|), 29292#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 29293#(and (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|)), 29294#(and (not (= 0 main_~list~0.base)) (= (store |#valid| main_~list~0.base 0) |old(#valid)|) (= (select |#valid| main_~list~0.base) 1)), 29295#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (store |#valid| main_~list~0.base 0) |old(#valid)|) (= (select |#valid| main_~list~0.base) 1)), 29296#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (store (store |#valid| main_~list~0.base 0) |main_#t~malloc4.base| 0) |old(#valid)|) (not (= main_~list~0.base |main_#t~malloc4.base|))), 29297#(and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0) |old(#valid)|) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)))), 29298#(and (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0) |old(#valid)|) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem6.base|))), 29299#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (not (= main_~list~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))) (= (store (store |#valid| main_~list~0.base 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) 0) |old(#valid)|)), 29300#(and (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0) |old(#valid)|) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 29301#(and (= (store (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0) |old(#valid)|) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)))), 29302#(and (not (= 0 main_~list~0.base)) (not (= main_~list~0.base |main_#t~mem24.base|)) (= (store (store |#valid| main_~list~0.base 0) |main_#t~mem24.base| 0) |old(#valid)|)), 29303#(and (not (= 0 main_~list~0.base)) (not (= main_~list~0.base main_~end~0.base)) (= |old(#valid)| (store (store |#valid| main_~list~0.base 0) main_~end~0.base 0))), 29304#(= (store |#valid| main_~end~0.base 0) |old(#valid)|), 29305#(= (store |#valid| main_~list~0.base 0) |old(#valid)|), 29306#(and (or (not (= main_~list~0.offset 0)) (not (= 0 main_~list~0.base))) (= (store |#valid| main_~list~0.base 0) |old(#valid)|))] [2018-02-02 10:32:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:34,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:32:34,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:32:34,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:32:34,433 INFO L87 Difference]: Start difference. First operand 353 states and 384 transitions. Second operand 18 states. [2018-02-02 10:32:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:34,917 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-02-02 10:32:34,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:32:34,917 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-02 10:32:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:34,918 INFO L225 Difference]: With dead ends: 365 [2018-02-02 10:32:34,918 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 10:32:34,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 10:32:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-02-02 10:32:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 10:32:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 353 transitions. [2018-02-02 10:32:34,921 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 353 transitions. Word has length 66 [2018-02-02 10:32:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:34,921 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 353 transitions. [2018-02-02 10:32:34,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:32:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 353 transitions. [2018-02-02 10:32:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:32:34,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:34,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 10:32:34,922 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1753935157, now seen corresponding path program 3 times [2018-02-02 10:32:34,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:34,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:35,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:35,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:35,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:35,396 INFO L134 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:32:35,397 INFO L182 omatonBuilderFactory]: Interpolants [30017#true, 30018#false, 30019#(= (select |#valid| main_~list~0.base) 1), 30020#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 30021#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 30022#(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)))), 30023#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 30024#(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)), 30025#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 30026#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|))), 30027#(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)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| 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))), 30028#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (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)) |main_#t~mem6.offset|) (= (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)) |main_#t~mem6.base|)), 30029#(and (not (= main_~end~0.base main_~list~0.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 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))) (= 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)) (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)))), 30030#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (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$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 30031#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 30032#(and (= 0 (select (select |#memory_$Pointer$.base| (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))) (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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))))), 30033#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 30034#(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)))), 30035#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 30036#(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))), 30037#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 30038#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-02-02 10:32:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:35,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:35,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:35,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:35,398 INFO L87 Difference]: Start difference. First operand 323 states and 353 transitions. Second operand 22 states. [2018-02-02 10:32:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:36,470 INFO L93 Difference]: Finished difference Result 373 states and 404 transitions. [2018-02-02 10:32:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:32:36,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2018-02-02 10:32:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:36,472 INFO L225 Difference]: With dead ends: 373 [2018-02-02 10:32:36,472 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 10:32:36,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:32:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 10:32:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 321. [2018-02-02 10:32:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-02-02 10:32:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 350 transitions. [2018-02-02 10:32:36,474 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 350 transitions. Word has length 66 [2018-02-02 10:32:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:36,474 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 350 transitions. [2018-02-02 10:32:36,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 350 transitions. [2018-02-02 10:32:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:32:36,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:36,475 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:36,475 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:36,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1577387628, now seen corresponding path program 1 times [2018-02-02 10:32:36,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:36,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:36,786 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:36,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:36,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:36,787 INFO L134 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:32:36,787 INFO L182 omatonBuilderFactory]: Interpolants [30784#(and (= |main_#t~mem6.base| (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))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) 1) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 30785#(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))) (= 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)) (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))) (= (select |#valid| 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)) 1)), 30786#(and (not (= (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~malloc11.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc11.base|)) (not (= main_~list~0.base |main_#t~malloc11.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~malloc11.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~malloc11.base|)) 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 |main_#t~malloc11.offset|)) main_~list~0.base) main_~list~0.offset)))), 30787#(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 (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 30788#(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~mem13.base|)) (not (= main_~list~0.base |main_#t~mem13.base|))), 30789#(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)))), 30790#(= 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)))), 30791#(= 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)))), 30792#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 30793#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 30794#(= 1 (select |#valid| |main_#t~mem18.base|)), 30795#(= 1 (select |#valid| main_~end~0.base)), 30773#true, 30774#false, 30775#(= (select |#valid| main_~list~0.base) 1), 30776#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 30777#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc4.base|)) (= main_~end~0.offset main_~list~0.offset)), 30778#(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)))), 30779#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem6.base|) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~list~0.base) 1)), 30780#(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)), 30781#(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_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 30782#(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~malloc4.offset|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc4.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc4.base|)) (not (= main_~list~0.base |main_#t~malloc4.base|)) (= (select |#valid| main_~list~0.base) 1)), 30783#(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))) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))] [2018-02-02 10:32:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:36,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:32:36,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:32:36,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:36,787 INFO L87 Difference]: Start difference. First operand 321 states and 350 transitions. Second operand 23 states. Received shutdown request... [2018-02-02 10:32:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:37,827 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:32:37,831 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:32:37,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:32:37 BoogieIcfgContainer [2018-02-02 10:32:37,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:32:37,832 INFO L168 Benchmark]: Toolchain (without parser) took 54000.06 ms. Allocated memory was 398.5 MB in the beginning and 1.2 GB in the end (delta: 821.0 MB). Free memory was 355.1 MB in the beginning and 1.1 GB in the end (delta: -696.0 MB). Peak memory consumption was 125.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:37,833 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:32:37,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.99 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 343.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:37,834 INFO L168 Benchmark]: Boogie Preprocessor took 31.09 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 341.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:37,834 INFO L168 Benchmark]: RCFGBuilder took 351.67 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 307.3 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:37,834 INFO L168 Benchmark]: TraceAbstraction took 53441.10 ms. Allocated memory was 398.5 MB in the beginning and 1.2 GB in the end (delta: 821.0 MB). Free memory was 307.3 MB in the beginning and 1.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:32:37,835 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.99 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 343.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.09 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 341.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 351.67 ms. Allocated memory is still 398.5 MB. Free memory was 340.6 MB in the beginning and 307.3 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53441.10 ms. Allocated memory was 398.5 MB in the beginning and 1.2 GB in the end (delta: 821.0 MB). Free memory was 307.3 MB in the beginning and 1.1 GB in the end (delta: -743.8 MB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1054). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (321states) and interpolant automaton (currently 30 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (390 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 117 locations, 47 error locations. TIMEOUT Result, 53.4s OverallTime, 58 OverallIterations, 4 TraceHistogramMax, 38.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4350 SDtfs, 16000 SDslu, 32603 SDs, 0 SdLazy, 48583 SolverSat, 3626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1861 GetRequests, 133 SyntacticMatches, 75 SemanticMatches, 1653 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13639 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 38/832 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 57 MinimizatonAttempts, 2467 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 2878 NumberOfCodeBlocks, 2878 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2820 ConstructedInterpolants, 0 QuantifiedInterpolants, 3055977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 10 PerfectInterpolantSequences, 38/832 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-32-37-843.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-32-37-843.csv Completed graceful shutdown