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-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:32:24,832 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:32:24,833 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:32:24,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:32:24,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:32:24,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:32:24,845 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:32:24,847 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:32:24,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:32:24,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:32:24,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:32:24,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:32:24,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:32:24,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:32:24,853 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:32:24,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:32:24,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:32:24,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:32:24,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:32:24,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:32:24,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:32:24,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:32:24,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:32:24,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:32:24,864 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:32:24,865 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:32:24,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:32:24,866 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:32:24,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:32:24,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:32:24,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:32:24,867 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:32:24,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:32:24,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:32:24,879 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:32:24,879 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:32:24,879 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:32:24,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:32:24,880 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:32:24,880 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:32:24,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:32:24,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:32:24,881 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:32:24,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:32:24,882 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:32:24,882 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:32:24,882 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:32:24,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:32:24,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:32:24,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:32:24,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:32:24,924 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:32:24,927 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:32:24,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:32:24,929 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:32:24,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:32:25,074 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:32:25,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:32:25,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:32:25,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:32:25,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:32:25,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd3f7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25, skipping insertion in model container [2018-02-02 10:32:25,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,098 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:32:25,128 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:32:25,217 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:32:25,235 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:32:25,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25 WrapperNode [2018-02-02 10:32:25,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:32:25,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:32:25,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:32:25,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:32:25,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (1/1) ... [2018-02-02 10:32:25,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:32:25,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:32:25,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:32:25,273 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:32:25,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (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:32:25,312 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:32:25,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:32:25,313 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:32:25,313 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:32:25,314 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:32:25,314 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:32:25,314 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:32:25,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:32:25,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:32:25,648 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:32:25,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:32:25 BoogieIcfgContainer [2018-02-02 10:32:25,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:32:25,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:32:25,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:32:25,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:32:25,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:32:25" (1/3) ... [2018-02-02 10:32:25,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469c01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:32:25, skipping insertion in model container [2018-02-02 10:32:25,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:25" (2/3) ... [2018-02-02 10:32:25,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469c01e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:32:25, skipping insertion in model container [2018-02-02 10:32:25,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:32:25" (3/3) ... [2018-02-02 10:32:25,655 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:32:25,663 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:32:25,670 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-02-02 10:32:25,701 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:32:25,702 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:32:25,702 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:32:25,702 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:32:25,702 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:32:25,702 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:32:25,702 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:32:25,702 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:32:25,703 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:32:25,716 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-02-02 10:32:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:32:25,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:25,725 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:25,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365916, now seen corresponding path program 1 times [2018-02-02 10:32:25,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:25,808 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,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:25,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:25,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:25,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:25,861 INFO L182 omatonBuilderFactory]: Interpolants [131#true, 132#false, 133#(= 1 (select |#valid| |main_#t~malloc0.base|)), 134#(= 1 (select |#valid| main_~null~0.base))] [2018-02-02 10:32:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:25,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:25,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:25,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:25,876 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 4 states. [2018-02-02 10:32:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,087 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-02 10:32:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:32:26,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:32:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,094 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:32:26,095 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:32:26,096 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:32:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:32:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 126. [2018-02-02 10:32:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:32:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-02-02 10:32:26,124 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 8 [2018-02-02 10:32:26,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,124 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-02-02 10:32:26,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-02-02 10:32:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:32:26,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,125 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:26,125 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365917, now seen corresponding path program 1 times [2018-02-02 10:32:26,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,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:32:26,185 INFO L134 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,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:26,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:26,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,185 INFO L134 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,185 INFO L182 omatonBuilderFactory]: Interpolants [411#true, 412#false, 413#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 414#(and (= (select |#length| main_~null~0.base) 8) (= main_~null~0.offset 0))] [2018-02-02 10:32:26,185 INFO L134 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,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:26,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:26,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:26,187 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 4 states. [2018-02-02 10:32:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,253 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-02 10:32:26,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:32:26,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:32:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,255 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:32:26,255 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:32:26,256 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:32:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:32:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:32:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:32:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-02 10:32:26,263 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 8 [2018-02-02 10:32:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,263 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-02 10:32:26,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-02 10:32:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:32:26,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,264 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:26,264 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1064079776, now seen corresponding path program 1 times [2018-02-02 10:32:26,265 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,278 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,305 INFO L134 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,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:26,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:26,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,306 INFO L134 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,306 INFO L182 omatonBuilderFactory]: Interpolants [663#true, 664#false, 665#(= 1 (select |#valid| |main_#t~malloc3.base|)), 666#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:32:26,306 INFO L134 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,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:26,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:26,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:26,307 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 4 states. [2018-02-02 10:32:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,419 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-02-02 10:32:26,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:26,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:32:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,420 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:32:26,420 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:32:26,421 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:32:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:32:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-02-02 10:32:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:32:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-02 10:32:26,425 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 12 [2018-02-02 10:32:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,426 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-02 10:32:26,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-02 10:32:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:32:26,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,426 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:26,426 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1064079775, now seen corresponding path program 1 times [2018-02-02 10:32:26,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,438 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,495 INFO L134 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,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:26,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:26,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,496 INFO L134 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,496 INFO L182 omatonBuilderFactory]: Interpolants [917#true, 918#false, 919#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 920#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8))] [2018-02-02 10:32:26,496 INFO L134 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,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:26,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:26,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:26,497 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-02-02 10:32:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,577 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-02 10:32:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:32:26,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:32:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,578 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:32:26,578 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:32:26,579 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:32:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:32:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 10:32:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:32:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-02-02 10:32:26,583 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 12 [2018-02-02 10:32:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,583 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-02-02 10:32:26,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-02-02 10:32:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:32:26,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,583 INFO L351 BasicCegarLoop]: trace histogram [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,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash 503792665, now seen corresponding path program 1 times [2018-02-02 10:32:26,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,601 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,645 INFO L134 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,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:26,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:26,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,646 INFO L182 omatonBuilderFactory]: Interpolants [1177#true, 1178#false, 1179#(= 1 (select |#valid| |main_#t~malloc3.base|)), 1180#(= 1 (select |#valid| main_~list~0.base)), 1181#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:26,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:26,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:26,646 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 5 states. [2018-02-02 10:32:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:26,782 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-02-02 10:32:26,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:26,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:32:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:26,783 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:32:26,783 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:32:26,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:26,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:32:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-02 10:32:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:32:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-02-02 10:32:26,798 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 19 [2018-02-02 10:32:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:26,798 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-02-02 10:32:26,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-02-02 10:32:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:32:26,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:26,799 INFO L351 BasicCegarLoop]: trace histogram [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,799 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:26,799 INFO L82 PathProgramCache]: Analyzing trace with hash 503792666, now seen corresponding path program 1 times [2018-02-02 10:32:26,804 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:26,821 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,874 INFO L134 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,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:26,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:26,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,875 INFO L182 omatonBuilderFactory]: Interpolants [1426#true, 1427#false, 1428#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1429#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 1430#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-02-02 10:32:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:26,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:26,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:26,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:26,876 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 5 states. [2018-02-02 10:32:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:27,024 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-02-02 10:32:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:27,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:32:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:27,025 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:32:27,025 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:32:27,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:32:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:32:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 123. [2018-02-02 10:32:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:32:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-02-02 10:32:27,028 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 19 [2018-02-02 10:32:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:27,029 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-02-02 10:32:27,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-02-02 10:32:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:32:27,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:27,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:27,029 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1871552874, now seen corresponding path program 1 times [2018-02-02 10:32:27,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:27,037 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:27,064 INFO L134 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:27,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:27,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:27,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:27,065 INFO L134 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:27,065 INFO L182 omatonBuilderFactory]: Interpolants [1705#true, 1706#false, 1707#(= 1 (select |#valid| |main_#t~malloc7.base|)), 1708#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1709#(= 1 (select |#valid| |main_#t~mem9.base|)), 1710#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:27,065 INFO L134 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:27,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:27,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:27,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:27,066 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 6 states. [2018-02-02 10:32:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:27,226 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-02-02 10:32:27,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:27,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:32:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:27,228 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:32:27,228 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:32:27,228 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:32:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:32:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2018-02-02 10:32:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:32:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-02-02 10:32:27,232 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 22 [2018-02-02 10:32:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:27,232 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-02-02 10:32:27,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-02-02 10:32:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:32:27,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:27,233 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:27,233 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1871552875, now seen corresponding path program 1 times [2018-02-02 10:32:27,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:27,245 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:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:27,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:27,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:27,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:27,309 INFO L182 omatonBuilderFactory]: Interpolants [2026#true, 2027#false, 2028#(and (= 0 |main_#t~malloc7.offset|) (= 8 (select |#length| |main_#t~malloc7.base|))), 2029#(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))), 2030#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 2031#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:32:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:27,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:27,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:27,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:27,309 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 6 states. [2018-02-02 10:32:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:27,474 INFO L93 Difference]: Finished difference Result 199 states and 217 transitions. [2018-02-02 10:32:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:27,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 10:32:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:27,475 INFO L225 Difference]: With dead ends: 199 [2018-02-02 10:32:27,475 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 10:32:27,476 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:32:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 10:32:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 117. [2018-02-02 10:32:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:32:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-02-02 10:32:27,478 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 22 [2018-02-02 10:32:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:27,479 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-02-02 10:32:27,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-02-02 10:32:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:32:27,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:27,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:27,480 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1255187673, now seen corresponding path program 1 times [2018-02-02 10:32:27,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:27,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:27,560 INFO L134 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:27,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:27,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:27,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:27,561 INFO L134 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:27,561 INFO L182 omatonBuilderFactory]: Interpolants [2359#true, 2360#false, 2361#(= 1 (select |#valid| |main_#t~malloc14.base|)), 2362#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2363#(= 1 (select |#valid| |main_#t~mem16.base|)), 2364#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:27,561 INFO L134 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:27,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:27,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:27,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:27,562 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2018-02-02 10:32:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:27,759 INFO L93 Difference]: Finished difference Result 199 states and 222 transitions. [2018-02-02 10:32:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:27,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:32:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:27,760 INFO L225 Difference]: With dead ends: 199 [2018-02-02 10:32:27,760 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 10:32:27,760 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:32:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 10:32:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 116. [2018-02-02 10:32:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:32:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2018-02-02 10:32:27,764 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 30 [2018-02-02 10:32:27,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:27,764 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2018-02-02 10:32:27,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2018-02-02 10:32:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:32:27,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:27,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:27,766 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1255187674, now seen corresponding path program 1 times [2018-02-02 10:32:27,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:27,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:27,849 INFO L134 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:27,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:27,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:27,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:27,850 INFO L134 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:27,850 INFO L182 omatonBuilderFactory]: Interpolants [2688#false, 2689#(and (= 8 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 2690#(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))), 2691#(and (= 0 |main_#t~mem16.offset|) (= 8 (select |#length| |main_#t~mem16.base|))), 2692#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 2687#true] [2018-02-02 10:32:27,850 INFO L134 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:27,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:27,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:27,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:27,851 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand 6 states. [2018-02-02 10:32:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:28,077 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2018-02-02 10:32:28,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:28,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:32:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:28,079 INFO L225 Difference]: With dead ends: 201 [2018-02-02 10:32:28,079 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:32:28,079 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:32:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:32:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2018-02-02 10:32:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:32:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2018-02-02 10:32:28,082 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 30 [2018-02-02 10:32:28,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:28,082 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2018-02-02 10:32:28,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:28,083 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2018-02-02 10:32:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:32:28,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:28,083 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:32:28,083 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1382402606, now seen corresponding path program 1 times [2018-02-02 10:32:28,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:28,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:28,128 INFO L134 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,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:28,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:32:28,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:28,129 INFO L134 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,129 INFO L182 omatonBuilderFactory]: Interpolants [3008#false, 3009#(= 0 |main_#t~malloc0.offset|), 3010#(= main_~null~0.offset 0), 3011#(= main_~null~0.offset |main_#t~malloc3.offset|), 3012#(= main_~null~0.offset main_~list~0.offset), 3013#(= main_~null~0.offset main_~end~0.offset), 3014#(not (= main_~end~0.base main_~null~0.base)), 3007#true] [2018-02-02 10:32:28,129 INFO L134 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,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:32:28,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:32:28,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:32:28,130 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 8 states. [2018-02-02 10:32:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:28,305 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-02 10:32:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:32:28,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-02-02 10:32:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:28,307 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:32:28,307 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:32:28,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:32:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:32:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 106. [2018-02-02 10:32:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:32:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-02-02 10:32:28,311 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 32 [2018-02-02 10:32:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:28,311 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-02-02 10:32:28,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:32:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-02-02 10:32:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:32:28,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:28,313 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] [2018-02-02 10:32:28,313 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -46210284, now seen corresponding path program 1 times [2018-02-02 10:32:28,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:28,327 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,402 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:32:28,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:28,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:32:28,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:28,403 INFO L134 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,403 INFO L182 omatonBuilderFactory]: Interpolants [3266#true, 3267#false, 3268#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 3269#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3270#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)), 3271#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:32:28,403 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:32:28,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:28,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:28,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:28,404 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 6 states. [2018-02-02 10:32:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:28,586 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-02-02 10:32:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:32:28,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:32:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:28,587 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:32:28,587 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:32:28,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:32:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2018-02-02 10:32:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:32:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-02-02 10:32:28,590 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 34 [2018-02-02 10:32:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:28,591 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-02-02 10:32:28,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-02-02 10:32:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:32:28,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:28,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:28,592 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 910103480, now seen corresponding path program 1 times [2018-02-02 10:32:28,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:28,601 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,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:28,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:28,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:28,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:28,680 INFO L134 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,680 INFO L182 omatonBuilderFactory]: Interpolants [3577#true, 3578#false, 3579#(= |main_#t~mem19| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 3580#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4))), 3581#(= ~unnamed0~BLACK |main_#t~mem20|)] [2018-02-02 10:32:28,680 INFO L134 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,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:28,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:28,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:28,681 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 5 states. [2018-02-02 10:32:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:28,744 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 10:32:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:28,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-02 10:32:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:28,745 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:32:28,745 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:32:28,746 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:32:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:32:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-02-02 10:32:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:32:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:32:28,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 36 [2018-02-02 10:32:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:28,748 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:32:28,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:32:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:32:28,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:28,749 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:28,749 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:28,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1369798728, now seen corresponding path program 1 times [2018-02-02 10:32:28,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:28,757 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,814 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:32:28,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:28,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:28,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:28,815 INFO L134 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,815 INFO L182 omatonBuilderFactory]: Interpolants [3840#(= main_~null~0.offset 0), 3841#(= main_~null~0.offset |main_#t~malloc3.offset|), 3842#(= main_~null~0.offset main_~list~0.offset), 3843#(and (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset main_~end~0.offset)), 3844#(and (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base main_~null~0.base))), 3845#(not (= main_~list~0.base main_~null~0.base)), 3837#true, 3838#false, 3839#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:32:28,816 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:32:28,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:32:28,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:32:28,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:32:28,835 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 9 states. [2018-02-02 10:32:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:29,022 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2018-02-02 10:32:29,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:32:29,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-02 10:32:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:29,023 INFO L225 Difference]: With dead ends: 133 [2018-02-02 10:32:29,023 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 10:32:29,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 10:32:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-02-02 10:32:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:32:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-02-02 10:32:29,026 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 38 [2018-02-02 10:32:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:29,026 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-02-02 10:32:29,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:32:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-02-02 10:32:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:32:29,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:29,029 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:29,029 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash -418354414, now seen corresponding path program 1 times [2018-02-02 10:32:29,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:29,040 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:29,099 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:32:29,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:29,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:32:29,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:29,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:29,100 INFO L182 omatonBuilderFactory]: Interpolants [4114#true, 4115#false, 4116#(= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))), 4117#(and (= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem19|)), 4118#(= (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))), 4119#(= |main_#t~mem20| (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4))), 4120#(not (= ~unnamed0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 4)))), 4121#(not (= ~unnamed0~RED |main_#t~mem24|))] [2018-02-02 10:32:29,100 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:32:29,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:32:29,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:32:29,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:32:29,101 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 8 states. [2018-02-02 10:32:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:29,292 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-02-02 10:32:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:29,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-02-02 10:32:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:29,293 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:32:29,293 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:32:29,293 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:32:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:32:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2018-02-02 10:32:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:32:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-02-02 10:32:29,296 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 41 [2018-02-02 10:32:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:29,296 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-02-02 10:32:29,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:32:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-02-02 10:32:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:29,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:29,297 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:29,297 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash 407562359, now seen corresponding path program 1 times [2018-02-02 10:32:29,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:29,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:29,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:29,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:32:29,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:29,415 INFO L182 omatonBuilderFactory]: Interpolants [4405#true, 4406#false, 4407#(= 0 |main_#t~malloc0.offset|), 4408#(= main_~null~0.offset 0), 4409#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 4410#(and (= main_~null~0.offset |main_#t~malloc3.offset|) (or (= main_~null~0.base |main_#t~malloc3.base|) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 |main_#t~malloc3.base|))))), 4411#(and (= main_~null~0.offset main_~list~0.offset) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 4412#(and (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base main_~null~0.base)) (= main_~null~0.offset main_~end~0.offset)), 4413#(and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base main_~null~0.base))), 4414#(and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base main_~null~0.base))), 4415#(= (select |#valid| main_~null~0.base) 1)] [2018-02-02 10:32:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:29,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:32:29,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:32:29,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:29,416 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 11 states. [2018-02-02 10:32:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:29,755 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-02 10:32:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:29,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-02-02 10:32:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:29,756 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:32:29,756 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:32:29,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:32:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2018-02-02 10:32:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:32:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-02 10:32:29,758 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 44 [2018-02-02 10:32:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:29,758 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-02 10:32:29,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:32:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-02 10:32:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:29,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:29,759 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:29,759 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 407562386, now seen corresponding path program 1 times [2018-02-02 10:32:29,760 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:29,767 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:29,819 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:32:29,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:29,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:29,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:29,819 INFO L134 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:29,819 INFO L182 omatonBuilderFactory]: Interpolants [4704#(and (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 4705#(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))), 4706#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4707#(and (= main_~null~0.offset |main_#t~mem27.offset|) (= main_~null~0.base |main_#t~mem27.base|)), 4708#(and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset)), 4709#(and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset)), 4701#true, 4702#false, 4703#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))] [2018-02-02 10:32:29,819 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:32:29,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:32:29,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:32:29,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:32:29,820 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 9 states. [2018-02-02 10:32:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:30,067 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-02-02 10:32:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:32:30,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-02-02 10:32:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:30,067 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:32:30,067 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:32:30,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:32:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2018-02-02 10:32:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:32:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2018-02-02 10:32:30,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 44 [2018-02-02 10:32:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:30,070 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2018-02-02 10:32:30,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:32:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2018-02-02 10:32:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:32:30,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:30,070 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] [2018-02-02 10:32:30,070 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash -53391375, now seen corresponding path program 1 times [2018-02-02 10:32:30,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:30,077 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,199 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:32:30,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:30,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:32:30,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:30,200 INFO L134 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,200 INFO L182 omatonBuilderFactory]: Interpolants [5028#true, 5029#false, 5030#(= (select |#valid| main_~list~0.base) 1), 5031#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5032#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 5033#(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)))), 5034#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 5035#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset))), 5036#(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)))), 5037#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 5038#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5039#(= 1 (select |#valid| |main_#t~mem23.base|)), 5040#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:30,200 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:32:30,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:32:30,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:32:30,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:32:30,201 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 13 states. [2018-02-02 10:32:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:30,608 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-02-02 10:32:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:32:30,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-02-02 10:32:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:30,609 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:32:30,609 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:32:30,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:32:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 165. [2018-02-02 10:32:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:32:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2018-02-02 10:32:30,613 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 45 [2018-02-02 10:32:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:30,613 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2018-02-02 10:32:30,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:32:30,613 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2018-02-02 10:32:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:32:30,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:30,614 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] [2018-02-02 10:32:30,614 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash -53391374, now seen corresponding path program 1 times [2018-02-02 10:32:30,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:30,625 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,756 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:32:30,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:30,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:32:30,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:30,757 INFO L134 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,757 INFO L182 omatonBuilderFactory]: Interpolants [5440#true, 5441#false, 5442#(= (select |#valid| main_~list~0.base) 1), 5443#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5444#(and (= 0 |main_#t~malloc7.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= 8 (select |#length| |main_#t~malloc7.base|))), 5445#(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)))), 5446#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5447#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 5448#(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)))), 5449#(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))), 5450#(and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))), 5451#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:32:30,757 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:32:30,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:32:30,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:32:30,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:32:30,757 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 12 states. [2018-02-02 10:32:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:31,138 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2018-02-02 10:32:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:32:31,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-02 10:32:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:31,139 INFO L225 Difference]: With dead ends: 218 [2018-02-02 10:32:31,139 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 10:32:31,139 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:32:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 10:32:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 168. [2018-02-02 10:32:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:32:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-02-02 10:32:31,142 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 45 [2018-02-02 10:32:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:31,142 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-02-02 10:32:31,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:32:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-02-02 10:32:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:32:31,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:31,143 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:31,143 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash 825408215, now seen corresponding path program 1 times [2018-02-02 10:32:31,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:31,151 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:31,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:31,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:31,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:32:31,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:31,398 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= |#valid| |old(#valid)|), 5857#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 5858#(and (= |old(#valid)| (store |#valid| main_~null~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)), 5859#(and (or (and (= (store (store |#valid| main_~null~0.base 0) |main_#t~malloc3.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc3.base|)) (not (= 0 main_~null~0.base))) (= |main_#t~malloc3.base| main_~null~0.base)) (= main_~null~0.offset |main_#t~malloc3.offset|)), 5860#(and (= main_~null~0.offset main_~list~0.offset) (or (and (not (= 0 main_~list~0.base)) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~null~0.base 0) main_~list~0.base (select (store |#valid| main_~list~0.base 0) main_~list~0.base)) |old(#valid)|)) (= main_~null~0.base main_~list~0.base))), 5861#(and (or (= main_~end~0.base main_~null~0.base) (and (not (= 0 main_~list~0.base)) (= main_~end~0.base main_~list~0.base) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~null~0.base 0) main_~list~0.base (select (store |#valid| main_~list~0.base 0) main_~list~0.base)) |old(#valid)|))) (= main_~null~0.offset main_~end~0.offset)), 5862#(and (not (= 0 main_~list~0.base)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base main_~null~0.base)) (= (store (store |#valid| main_~null~0.base 0) main_~list~0.base (select (store |#valid| main_~list~0.base 0) main_~list~0.base)) |old(#valid)|)), 5863#(and (not (= 0 main_~list~0.base)) (not (= 0 main_~null~0.base)) (not (= main_~list~0.base main_~null~0.base)) (= (store (store |#valid| main_~null~0.base 0) main_~list~0.base (select (store |#valid| main_~list~0.base 0) main_~list~0.base)) |old(#valid)|)), 5864#(and (not (= 0 main_~null~0.base)) (= |old(#valid)| (store |#valid| main_~null~0.base (select (store |#valid| main_~null~0.base 0) main_~null~0.base)))), 5854#true, 5855#false] [2018-02-02 10:32:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:31,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:32:31,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:32:31,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:31,399 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 11 states. [2018-02-02 10:32:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:31,939 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-02-02 10:32:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:32:31,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-02-02 10:32:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:31,940 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:32:31,940 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:32:31,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:32:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:32:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:32:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-02-02 10:32:31,942 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 46 [2018-02-02 10:32:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:31,942 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-02-02 10:32:31,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:32:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-02-02 10:32:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:32:31,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:31,943 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] [2018-02-02 10:32:31,943 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:31,943 INFO L82 PathProgramCache]: Analyzing trace with hash 621078167, now seen corresponding path program 2 times [2018-02-02 10:32:31,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:31,950 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,150 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:32,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:32,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:32,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:32,150 INFO L134 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,151 INFO L182 omatonBuilderFactory]: Interpolants [6218#true, 6219#false, 6220#(= (select |#valid| main_~list~0.base) 1), 6221#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6222#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 6223#(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)))), 6224#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.offset|)), 6225#(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 main_~null~0.base)) 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 6226#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~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)) (= main_~null~0.offset (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))), 6227#(and (= main_~null~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))) (= main_~null~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)))), 6228#(and (= main_~null~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))) (= main_~null~0.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)))), 6229#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 6230#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6231#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)), 6232#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:32:32,151 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:32,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:32,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:32,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:32,151 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 15 states. [2018-02-02 10:32:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:32,681 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2018-02-02 10:32:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:32:32,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-02-02 10:32:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:32,682 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:32:32,682 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:32:32,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 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:32:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:32:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 155. [2018-02-02 10:32:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:32:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 166 transitions. [2018-02-02 10:32:32,685 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 166 transitions. Word has length 51 [2018-02-02 10:32:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:32,685 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 166 transitions. [2018-02-02 10:32:32,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2018-02-02 10:32:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:32:32,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:32,686 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] [2018-02-02 10:32:32,686 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1762718920, now seen corresponding path program 1 times [2018-02-02 10:32:32,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:32,698 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,868 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:32:32,868 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:32,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:32,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:32,869 INFO L134 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,869 INFO L182 omatonBuilderFactory]: Interpolants [6624#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6625#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6626#(and (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 6627#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6628#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem16.base|))), 6629#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 6630#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6631#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6632#(= 1 (select |#valid| |main_#t~mem23.base|)), 6633#(= 1 (select |#valid| main_~end~0.base)), 6618#true, 6619#false, 6620#(= (select |#valid| main_~list~0.base) 1), 6621#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6622#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 6623#(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:32,869 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:32:32,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:32,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:32,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:32,869 INFO L87 Difference]: Start difference. First operand 155 states and 166 transitions. Second operand 16 states. [2018-02-02 10:32:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:33,592 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-02-02 10:32:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:32:33,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-02-02 10:32:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:33,596 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:32:33,596 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 10:32:33,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:33,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 10:32:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 182. [2018-02-02 10:32:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:32:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2018-02-02 10:32:33,599 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 51 [2018-02-02 10:32:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:33,600 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2018-02-02 10:32:33,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2018-02-02 10:32:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:32:33,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:33,600 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] [2018-02-02 10:32:33,600 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1762718919, now seen corresponding path program 1 times [2018-02-02 10:32:33,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:33,613 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,940 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:32:33,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:33,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:32:33,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:33,941 INFO L134 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,941 INFO L182 omatonBuilderFactory]: Interpolants [7075#true, 7076#false, 7077#(= (select |#valid| main_~list~0.base) 1), 7078#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7079#(and (= 0 |main_#t~malloc7.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= 8 (select |#length| |main_#t~malloc7.base|))), 7080#(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)))), 7081#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= 8 (select |#length| |main_#t~mem9.base|)) (= (select |#valid| main_~list~0.base) 1)), 7082#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#length| main_~end~0.base) 8) (= 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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 7083#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= (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) (= (select |#valid| main_~list~0.base) 1)), 7084#(and (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (<= 8 (select |#length| main_~end~0.base))), 7085#(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))), 7086#(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~mem16.base|))), 7087#(and (not (= main_~end~0.base main_~list~0.base)) (<= 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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 7088#(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)))), 7089#(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))), 7090#(and (= 0 |main_#t~mem23.offset|) (<= 8 (select |#length| |main_#t~mem23.base|))), 7091#(and (= main_~end~0.offset 0) (<= 8 (select |#length| main_~end~0.base)))] [2018-02-02 10:32:33,941 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:32:33,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:32:33,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:32:33,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:32:33,942 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand 17 states. [2018-02-02 10:32:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:34,576 INFO L93 Difference]: Finished difference Result 233 states and 249 transitions. [2018-02-02 10:32:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:32:34,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-02 10:32:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:34,576 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:32:34,577 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:32:34,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:32:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2018-02-02 10:32:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:32:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2018-02-02 10:32:34,579 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 51 [2018-02-02 10:32:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:34,579 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2018-02-02 10:32:34,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:32:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2018-02-02 10:32:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:32:34,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:34,579 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:34,579 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2070789509, now seen corresponding path program 1 times [2018-02-02 10:32:34,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:34,586 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,802 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:32:34,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:34,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:34,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:34,802 INFO L134 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,802 INFO L182 omatonBuilderFactory]: Interpolants [7533#true, 7534#false, 7535#(= (select |#valid| main_~list~0.base) 1), 7536#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7537#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 7538#(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)))), 7539#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.offset|)), 7540#(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 main_~null~0.base)) 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 7541#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~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)) (= main_~null~0.offset (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))), 7542#(and (= main_~null~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))) (= main_~null~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)))), 7543#(and (= main_~null~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))) (= main_~null~0.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)))), 7544#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 7545#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7546#(and (= main_~null~0.base |main_#t~mem21.base|) (= main_~null~0.offset |main_#t~mem21.offset|)), 7547#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:32:34,803 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:32:34,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:34,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:34,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:34,803 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand 15 states. [2018-02-02 10:32:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:35,275 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-02-02 10:32:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:32:35,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 10:32:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:35,276 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:32:35,276 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:32:35,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 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:32:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:32:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2018-02-02 10:32:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:32:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2018-02-02 10:32:35,279 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 53 [2018-02-02 10:32:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:35,279 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2018-02-02 10:32:35,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2018-02-02 10:32:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:32:35,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:35,280 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] [2018-02-02 10:32:35,280 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2078333196, now seen corresponding path program 3 times [2018-02-02 10:32:35,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:35,292 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,458 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:35,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:35,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:35,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:35,458 INFO L134 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,458 INFO L182 omatonBuilderFactory]: Interpolants [7968#true, 7969#false, 7970#(= (select |#valid| main_~list~0.base) 1), 7971#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7972#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 7973#(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)))), 7974#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7975#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 7976#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|))), 7977#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7978#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7979#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 7980#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 7981#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7982#(= 1 (select |#valid| |main_#t~mem23.base|)), 7983#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:35,458 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:35,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:35,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:35,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:35,459 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand 16 states. [2018-02-02 10:32:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:36,048 INFO L93 Difference]: Finished difference Result 259 states and 277 transitions. [2018-02-02 10:32:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:36,048 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 10:32:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:36,049 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:32:36,049 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:32:36,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:32:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 212. [2018-02-02 10:32:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 10:32:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 229 transitions. [2018-02-02 10:32:36,051 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 229 transitions. Word has length 56 [2018-02-02 10:32:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:36,051 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 229 transitions. [2018-02-02 10:32:36,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 229 transitions. [2018-02-02 10:32:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:32:36,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:36,052 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] [2018-02-02 10:32:36,052 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2078333195, now seen corresponding path program 2 times [2018-02-02 10:32:36,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:36,059 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,297 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,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:36,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:36,298 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:36,298 INFO L134 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,298 INFO L182 omatonBuilderFactory]: Interpolants [8487#true, 8488#false, 8489#(= (select |#valid| main_~list~0.base) 1), 8490#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8491#(and (= 0 |main_#t~malloc7.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= 8 (select |#length| |main_#t~malloc7.base|))), 8492#(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)))), 8493#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~mem9.base|)) (= (select |#valid| main_~list~0.base) 1)), 8494#(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 main_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 8495#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 8496#(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))), 8497#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8498#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 8499#(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)))), 8500#(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))), 8501#(and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))), 8502#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:32:36,298 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,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:36,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:36,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:36,299 INFO L87 Difference]: Start difference. First operand 212 states and 229 transitions. Second operand 16 states. [2018-02-02 10:32:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:36,869 INFO L93 Difference]: Finished difference Result 265 states and 284 transitions. [2018-02-02 10:32:36,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:32:36,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 10:32:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:36,870 INFO L225 Difference]: With dead ends: 265 [2018-02-02 10:32:36,870 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 10:32:36,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:32:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 10:32:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 192. [2018-02-02 10:32:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:32:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2018-02-02 10:32:36,872 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 56 [2018-02-02 10:32:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:36,872 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2018-02-02 10:32:36,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2018-02-02 10:32:36,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:32:36,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:36,873 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] [2018-02-02 10:32:36,873 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1818246092, now seen corresponding path program 1 times [2018-02-02 10:32:36,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:36,879 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:37,102 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:32:37,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:37,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:32:37,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:37,103 INFO L134 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:37,103 INFO L182 omatonBuilderFactory]: Interpolants [8992#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~null~0.base) 1))), 8993#(or (and (not (= main_~null~0.base |main_#t~malloc7.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 8994#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (not (= main_~null~0.base (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))))), 8995#(or (and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 8996#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))))), 8997#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8998#(or (and (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base))) (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))), 8999#(and (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base))), 9000#(not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 9001#(not (= main_~null~0.base |main_#t~mem27.base|)), 9002#(not (= main_~null~0.base main_~end~0.base)), 9003#(not (= main_~null~0.base main_~list~0.base)), 8984#true, 8985#false, 8986#(= 0 |main_#t~malloc0.offset|), 8987#(= main_~null~0.offset 0), 8988#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 8989#(and (or (not (= main_~null~0.base |main_#t~malloc3.base|)) (= main_~null~0.offset |main_#t~malloc3.offset|)) (or (= main_~null~0.base |main_#t~malloc3.base|) (= (select |#valid| main_~null~0.base) 1))), 8990#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= (select |#valid| main_~null~0.base) 1)), 8991#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= (select |#valid| main_~null~0.base) 1) (= (select |#valid| main_~list~0.base) 1)))] [2018-02-02 10:32:37,104 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:32:37,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:37,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:37,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:37,104 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand 20 states. [2018-02-02 10:32:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:37,992 INFO L93 Difference]: Finished difference Result 231 states and 245 transitions. [2018-02-02 10:32:37,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:32:37,993 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-02-02 10:32:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:37,993 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:32:37,993 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 10:32:37,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:32:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 10:32:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 202. [2018-02-02 10:32:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:32:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2018-02-02 10:32:37,995 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 57 [2018-02-02 10:32:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:37,996 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2018-02-02 10:32:37,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2018-02-02 10:32:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:32:37,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:37,996 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, 1, 1, 1, 1] [2018-02-02 10:32:37,996 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash -830156642, now seen corresponding path program 2 times [2018-02-02 10:32:37,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:38,005 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:38,262 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:32:38,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:38,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:38,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:38,262 INFO L134 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:38,263 INFO L182 omatonBuilderFactory]: Interpolants [9483#true, 9484#false, 9485#(= (select |#valid| main_~list~0.base) 1), 9486#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9487#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 9488#(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)))), 9489#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 9490#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 9491#(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))), 9492#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 9493#(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))), 9494#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= |main_#t~mem16.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~mem16.base|))), 9495#(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 main_~null~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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 9496#(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)), 9497#(= 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)))), 9498#(= 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)))), 9499#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 9500#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 9501#(= 1 (select |#valid| |main_#t~mem23.base|)), 9502#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:38,263 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:32:38,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:38,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:38,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:38,263 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand 20 states. [2018-02-02 10:32:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:39,054 INFO L93 Difference]: Finished difference Result 277 states and 296 transitions. [2018-02-02 10:32:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:32:39,054 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-02-02 10:32:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:39,055 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:32:39,055 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:32:39,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:32:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:32:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 228. [2018-02-02 10:32:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:32:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 246 transitions. [2018-02-02 10:32:39,058 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 246 transitions. Word has length 57 [2018-02-02 10:32:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:39,058 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 246 transitions. [2018-02-02 10:32:39,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 246 transitions. [2018-02-02 10:32:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:32:39,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:39,059 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, 1, 1, 1, 1] [2018-02-02 10:32:39,059 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -830156641, now seen corresponding path program 2 times [2018-02-02 10:32:39,060 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:39,072 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:39,372 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:32:39,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:39,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:32:39,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:39,373 INFO L134 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:39,373 INFO L182 omatonBuilderFactory]: Interpolants [10048#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 10049#(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)))), 10050#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 10051#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 10052#(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))), 10053#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc14.base|)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 10054#(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))))), 10055#(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)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem16.base|))), 10056#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~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_~null~0.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_~null~0.offset)) 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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 10057#(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)))), 10058#(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)))), 10059#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 10060#(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))), 10061#(and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))), 10062#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 10044#true, 10045#false, 10046#(= (select |#valid| main_~list~0.base) 1), 10047#(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:32:39,373 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:32:39,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:32:39,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:32:39,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:32:39,374 INFO L87 Difference]: Start difference. First operand 228 states and 246 transitions. Second operand 19 states. [2018-02-02 10:32:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:40,277 INFO L93 Difference]: Finished difference Result 283 states and 303 transitions. [2018-02-02 10:32:40,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:40,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-02-02 10:32:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:40,278 INFO L225 Difference]: With dead ends: 283 [2018-02-02 10:32:40,278 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 10:32:40,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 10:32:40,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 227. [2018-02-02 10:32:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 10:32:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 244 transitions. [2018-02-02 10:32:40,280 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 244 transitions. Word has length 57 [2018-02-02 10:32:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:40,281 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 244 transitions. [2018-02-02 10:32:40,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:32:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 244 transitions. [2018-02-02 10:32:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:32:40,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:40,281 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:40,281 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash -843069758, now seen corresponding path program 1 times [2018-02-02 10:32:40,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:40,288 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:40,488 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:32:40,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:40,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:40,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:40,488 INFO L134 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:40,489 INFO L182 omatonBuilderFactory]: Interpolants [10599#true, 10600#false, 10601#(= (select |#valid| main_~list~0.base) 1), 10602#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 10603#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 10604#(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)))), 10605#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 10606#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 10607#(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))), 10608#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 10609#(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))), 10610#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= |main_#t~mem16.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~mem16.base|))), 10611#(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 main_~null~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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 10612#(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)), 10613#(= 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)))), 10614#(= 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)))), 10615#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 10616#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 10617#(= 1 (select |#valid| |main_#t~mem21.base|)), 10618#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:32:40,489 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:32:40,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:40,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:40,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:40,489 INFO L87 Difference]: Start difference. First operand 227 states and 244 transitions. Second operand 20 states. [2018-02-02 10:32:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:41,235 INFO L93 Difference]: Finished difference Result 279 states and 299 transitions. [2018-02-02 10:32:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:32:41,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-02-02 10:32:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:41,236 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:32:41,236 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:32:41,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:32:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:32:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2018-02-02 10:32:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:32:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 252 transitions. [2018-02-02 10:32:41,239 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 252 transitions. Word has length 59 [2018-02-02 10:32:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:41,239 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 252 transitions. [2018-02-02 10:32:41,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 252 transitions. [2018-02-02 10:32:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:32:41,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:41,240 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:41,240 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash -843069757, now seen corresponding path program 1 times [2018-02-02 10:32:41,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:41,253 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:41,634 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:32:41,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:41,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:32:41,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:41,635 INFO L134 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:41,635 INFO L182 omatonBuilderFactory]: Interpolants [11168#(= 0 |main_#t~malloc0.offset|), 11169#(= main_~null~0.offset 0), 11170#(and (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 11171#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 11172#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~null~0.offset 0)), 11173#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 11174#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 11175#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 11176#(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) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11177#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc14.base|)) (= 0 main_~null~0.offset) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~malloc14.offset|)), 11178#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 main_~null~0.offset) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 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))))), 11179#(and (= 0 main_~null~0.offset) (= main_~null~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))) (= 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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (not (= main_~list~0.base |main_#t~mem16.base|))), 11180#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 main_~null~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_~null~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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset)))) (= main_~null~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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 11181#(and (= 0 main_~null~0.offset) (= main_~null~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))) (= 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))))), 11182#(and (= 0 main_~null~0.offset) (= main_~null~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))) (= 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))))), 11183#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 0 main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 11184#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 11185#(and (= 0 main_~null~0.offset) (= main_~null~0.offset |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 11186#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 11166#true, 11167#false] [2018-02-02 10:32:41,635 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:32:41,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:32:41,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:32:41,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:41,636 INFO L87 Difference]: Start difference. First operand 234 states and 252 transitions. Second operand 21 states. [2018-02-02 10:32:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:42,650 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-02-02 10:32:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:32:42,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-02-02 10:32:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:42,651 INFO L225 Difference]: With dead ends: 284 [2018-02-02 10:32:42,651 INFO L226 Difference]: Without dead ends: 284 [2018-02-02 10:32:42,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1350, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:32:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-02-02 10:32:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2018-02-02 10:32:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-02-02 10:32:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 253 transitions. [2018-02-02 10:32:42,655 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 253 transitions. Word has length 59 [2018-02-02 10:32:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:42,655 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 253 transitions. [2018-02-02 10:32:42,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:32:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 253 transitions. [2018-02-02 10:32:42,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:32:42,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:42,655 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] [2018-02-02 10:32:42,655 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:42,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1615813547, now seen corresponding path program 1 times [2018-02-02 10:32:42,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:42,661 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:43,059 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:43,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:43,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:32:43,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:43,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:32:43,060 INFO L182 omatonBuilderFactory]: Interpolants [11747#true, 11748#false, 11749#(= 0 |main_#t~malloc0.offset|), 11750#(= main_~null~0.offset 0), 11751#(and (not (= 0 |main_#t~malloc3.base|)) (= main_~null~0.offset |main_#t~malloc3.offset|) (= |main_#t~malloc3.offset| 0)), 11752#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset)), 11753#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 11754#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 11755#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~list~0.offset |main_#t~malloc7.offset|) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 11756#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~list~0.offset (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)))), 11757#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11758#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 11759#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11760#(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)) (= main_~null~0.offset 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))), 11761#(and (not (= 0 main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base main_~null~0.base)) (= (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))), 11762#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem23.base|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) |main_#t~mem23.offset|) |main_#t~mem23.base|) (not (= main_~list~0.base main_~null~0.base))), 11763#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (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)))), 11764#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (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))))), 11765#(and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= |main_#t~mem23.base| main_~null~0.base)))), 11766#(and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~null~0.base)))), 11767#(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)))), 11768#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem27.base|))), 11769#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 11770#(= 1 (select |#valid| main_~end~0.base)), 11771#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:32:43,060 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:43,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:43,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:43,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:43,061 INFO L87 Difference]: Start difference. First operand 236 states and 253 transitions. Second operand 25 states. [2018-02-02 10:32:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:44,307 INFO L93 Difference]: Finished difference Result 246 states and 264 transitions. [2018-02-02 10:32:44,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:32:44,307 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-02-02 10:32:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:44,308 INFO L225 Difference]: With dead ends: 246 [2018-02-02 10:32:44,308 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 10:32:44,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:32:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 10:32:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 237. [2018-02-02 10:32:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:32:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 255 transitions. [2018-02-02 10:32:44,311 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 255 transitions. Word has length 61 [2018-02-02 10:32:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:44,311 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 255 transitions. [2018-02-02 10:32:44,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 255 transitions. [2018-02-02 10:32:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:32:44,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:44,311 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] [2018-02-02 10:32:44,311 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1615813546, now seen corresponding path program 1 times [2018-02-02 10:32:44,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:44,318 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:44,396 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:44,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:44,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:44,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:44,397 INFO L182 omatonBuilderFactory]: Interpolants [12320#(and (<= (+ main_~list~0.offset 8) (select |#length| main_~list~0.base)) (<= 0 main_~list~0.offset)), 12311#true, 12312#false, 12313#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base)), 12314#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem23.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem23.offset|)), 12315#(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))), 12316#(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))), 12317#(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))), 12318#(and (<= 0 |main_#t~mem27.offset|) (<= (+ |main_#t~mem27.offset| 8) (select |#length| |main_#t~mem27.base|))), 12319#(and (<= (+ main_~end~0.offset 8) (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset))] [2018-02-02 10:32:44,397 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:44,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:32:44,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:32:44,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:44,397 INFO L87 Difference]: Start difference. First operand 237 states and 255 transitions. Second operand 10 states. [2018-02-02 10:32:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:44,634 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2018-02-02 10:32:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:44,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-02-02 10:32:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:44,635 INFO L225 Difference]: With dead ends: 288 [2018-02-02 10:32:44,635 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 10:32:44,636 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:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 10:32:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 241. [2018-02-02 10:32:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 10:32:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 260 transitions. [2018-02-02 10:32:44,638 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 260 transitions. Word has length 61 [2018-02-02 10:32:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:44,638 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 260 transitions. [2018-02-02 10:32:44,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:32:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 260 transitions. [2018-02-02 10:32:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:44,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:44,639 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, 1, 1, 1, 1] [2018-02-02 10:32:44,639 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash 956837722, now seen corresponding path program 4 times [2018-02-02 10:32:44,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:44,645 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:44,929 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:44,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:44,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:44,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:44,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:44,930 INFO L182 omatonBuilderFactory]: Interpolants [12864#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 12865#(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)))), 12866#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 12867#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 12868#(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))), 12869#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset))), 12870#(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))), 12871#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|)) (= |main_#t~mem9.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)))), 12872#(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 main_~null~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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 12873#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 12874#(= 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)))), 12875#(= 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)))), 12876#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 12877#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 12878#(= 1 (select |#valid| |main_#t~mem23.base|)), 12879#(= 1 (select |#valid| main_~end~0.base)), 12860#true, 12861#false, 12862#(= (select |#valid| main_~list~0.base) 1), 12863#(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:32:44,930 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:44,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:44,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:44,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:44,930 INFO L87 Difference]: Start difference. First operand 241 states and 260 transitions. Second operand 20 states. [2018-02-02 10:32:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:45,833 INFO L93 Difference]: Finished difference Result 303 states and 326 transitions. [2018-02-02 10:32:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:32:45,833 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-02-02 10:32:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:45,834 INFO L225 Difference]: With dead ends: 303 [2018-02-02 10:32:45,834 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 10:32:45,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:32:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 10:32:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 248. [2018-02-02 10:32:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:32:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-02-02 10:32:45,851 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 62 [2018-02-02 10:32:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:45,851 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-02-02 10:32:45,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:32:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-02-02 10:32:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:45,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:45,852 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, 1, 1, 1, 1] [2018-02-02 10:32:45,852 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash 956837723, now seen corresponding path program 3 times [2018-02-02 10:32:45,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:45,865 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:46,165 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:46,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:46,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:32:46,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:46,165 INFO L134 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:46,165 INFO L182 omatonBuilderFactory]: Interpolants [13472#(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)))), 13473#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 13474#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 13475#(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))), 13476#(and (= 0 |main_#t~malloc7.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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc7.base|))), 13477#(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))))), 13478#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.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)))), 13479#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~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_~null~0.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_~null~0.offset)) 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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 13480#(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)))), 13481#(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)))), 13482#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 13483#(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))), 13484#(and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))), 13485#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 13467#true, 13468#false, 13469#(= (select |#valid| main_~list~0.base) 1), 13470#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 13471#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)))] [2018-02-02 10:32:46,165 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:46,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:32:46,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:32:46,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:32:46,166 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 19 states. [2018-02-02 10:32:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:47,181 INFO L93 Difference]: Finished difference Result 309 states and 333 transitions. [2018-02-02 10:32:47,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:47,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-02-02 10:32:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:47,182 INFO L225 Difference]: With dead ends: 309 [2018-02-02 10:32:47,182 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 10:32:47,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:47,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 10:32:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 243. [2018-02-02 10:32:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:32:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 263 transitions. [2018-02-02 10:32:47,185 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 263 transitions. Word has length 62 [2018-02-02 10:32:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:47,185 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 263 transitions. [2018-02-02 10:32:47,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:32:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 263 transitions. [2018-02-02 10:32:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:47,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:47,186 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, 1, 1, 1, 1] [2018-02-02 10:32:47,186 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1426959365, now seen corresponding path program 1 times [2018-02-02 10:32:47,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:47,202 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:47,729 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:47,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:47,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:47,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:47,730 INFO L134 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:47,730 INFO L182 omatonBuilderFactory]: Interpolants [14080#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (or (= main_~list~0.offset |main_#t~mem16.offset|) (not (= main_~list~0.base |main_#t~mem16.base|)))), 14081#(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 main_~null~0.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_~null~0.base)) 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))), 14082#(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)))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 14083#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 14084#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (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)))), 14085#(or (and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)) (= 1 (select |#valid| |main_#t~mem23.base|))), 14086#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 14087#(= 1 (select |#valid| main_~end~0.base)), 14064#true, 14065#false, 14066#(= |main_#t~malloc3.offset| 0), 14067#(= main_~list~0.offset 0), 14068#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 14069#(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)), 14070#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~list~0.base main_~end~0.base)), 14071#(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)))), 14072#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 14073#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 14074#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|))), 14075#(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)) (= 1 (select |#valid| main_~end~0.base))), 14076#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 14077#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 14078#(and (or (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~list~0.offset |main_#t~malloc14.offset|)) (or (= |main_#t~malloc14.base| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= 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~malloc14.base|)) main_~list~0.base) main_~list~0.offset))))), 14079#(and (or (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))) (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))))] [2018-02-02 10:32:47,730 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:47,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:47,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:47,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:47,731 INFO L87 Difference]: Start difference. First operand 243 states and 263 transitions. Second operand 24 states. [2018-02-02 10:32:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:49,164 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2018-02-02 10:32:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:32:49,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:32:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:49,198 INFO L225 Difference]: With dead ends: 333 [2018-02-02 10:32:49,198 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 10:32:49,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=853, Invalid=2929, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:32:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 10:32:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 270. [2018-02-02 10:32:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 10:32:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 293 transitions. [2018-02-02 10:32:49,200 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 293 transitions. Word has length 62 [2018-02-02 10:32:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:49,201 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 293 transitions. [2018-02-02 10:32:49,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 293 transitions. [2018-02-02 10:32:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:49,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:49,201 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, 1, 1, 1, 1] [2018-02-02 10:32:49,201 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1426959364, now seen corresponding path program 1 times [2018-02-02 10:32:49,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:49,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:49,828 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:49,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:49,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:32:49,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:49,828 INFO L134 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:49,829 INFO L182 omatonBuilderFactory]: Interpolants [14784#(and (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 0 main_~null~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~malloc14.base|)) main_~list~0.base) main_~list~0.offset))) (= main_~list~0.offset |main_#t~malloc14.offset|)), 14785#(and (= 0 main_~null~0.offset) (<= 8 (select |#length| (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_~null~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 14786#(and (= 0 main_~null~0.offset) (= main_~list~0.offset |main_#t~mem16.offset|) (<= 8 (select |#length| (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_~null~0.offset)), 14787#(and (= 0 main_~null~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 main_~null~0.base)) 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 (and (not (= main_~end~0.base 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 14788#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 main_~null~0.offset) (or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (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)))))), 14789#(and (or (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 0 main_~null~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 14790#(and (or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| 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))), 14791#(and (= 0 |main_#t~mem23.offset|) (or (and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)) (<= 8 (select |#length| |main_#t~mem23.base|)))), 14792#(and (or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (<= 8 (select |#length| main_~end~0.base))) (= main_~end~0.offset 0)), 14793#(and (= main_~end~0.offset 0) (<= 8 (select |#length| main_~end~0.base))), 14767#true, 14768#false, 14769#(= 0 |main_#t~malloc0.offset|), 14770#(= 0 main_~null~0.offset), 14771#(and (= 0 main_~null~0.offset) (= |main_#t~malloc3.offset| 0)), 14772#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset)), 14773#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= (select |#valid| main_~list~0.base) 1)), 14774#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 14775#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~list~0.base main_~end~0.base) (= |main_#t~malloc7.offset| main_~null~0.offset) (= 8 (select |#length| |main_#t~malloc7.base|))), 14776#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~null~0.offset)), 14777#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 main_~null~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 8 (select |#length| |main_#t~mem9.base|)) (= (select |#valid| main_~list~0.base) 1)), 14778#(and (= main_~list~0.offset 0) (not (= main_~end~0.base 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 0 main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 14779#(and (= main_~list~0.offset 0) (= 0 main_~null~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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 8 (select |#length| main_~end~0.base))), 14780#(and (= main_~list~0.offset 0) (= 0 main_~null~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 (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select |#valid| main_~end~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 14781#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= 0 main_~null~0.offset) (= (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 (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset)), 14782#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (<= 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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 0 main_~null~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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) 1)), 14783#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= 0 main_~null~0.offset) (= (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 (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 10:32:49,829 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:49,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:32:49,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:32:49,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:32:49,829 INFO L87 Difference]: Start difference. First operand 270 states and 293 transitions. Second operand 27 states. [2018-02-02 10:32:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:51,910 INFO L93 Difference]: Finished difference Result 352 states and 379 transitions. [2018-02-02 10:32:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:32:51,910 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 62 [2018-02-02 10:32:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:51,911 INFO L225 Difference]: With dead ends: 352 [2018-02-02 10:32:51,911 INFO L226 Difference]: Without dead ends: 352 [2018-02-02 10:32:51,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1159, Invalid=3953, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:32:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-02 10:32:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 269. [2018-02-02 10:32:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:32:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2018-02-02 10:32:51,914 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 62 [2018-02-02 10:32:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:51,914 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2018-02-02 10:32:51,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:32:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2018-02-02 10:32:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:51,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:51,915 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, 1, 1, 1, 1] [2018-02-02 10:32:51,915 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:51,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1274243405, now seen corresponding path program 2 times [2018-02-02 10:32:51,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:51,925 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:52,291 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:52,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:52,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:32:52,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:52,292 INFO L134 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:52,292 INFO L182 omatonBuilderFactory]: Interpolants [15520#(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)))), 15521#(and (or (= |main_#t~mem9.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)))) (= main_~list~0.offset |main_#t~mem9.offset|)), 15522#(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 main_~null~0.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_~null~0.base)) 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))), 15523#(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)))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 15524#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 15525#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (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)))), 15526#(or (and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)) (= 1 (select |#valid| |main_#t~mem23.base|))), 15527#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 15528#(= 1 (select |#valid| main_~end~0.base)), 15505#true, 15506#false, 15507#(= |main_#t~malloc3.offset| 0), 15508#(= main_~list~0.offset 0), 15509#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 15510#(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)), 15511#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~list~0.base main_~end~0.base)), 15512#(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)))), 15513#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 15514#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 15515#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))), 15516#(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)) (= 1 (select |#valid| main_~end~0.base))), 15517#(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~mem16.base|))), 15518#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 15519#(and (= main_~list~0.offset |main_#t~malloc7.offset|) (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~malloc7.base|)) main_~list~0.base) main_~list~0.offset))) (= |main_#t~malloc7.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~malloc7.base|)) main_~list~0.base) main_~list~0.offset))))] [2018-02-02 10:32:52,292 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:52,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:32:52,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:32:52,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:52,293 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 24 states. [2018-02-02 10:32:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:53,824 INFO L93 Difference]: Finished difference Result 387 states and 419 transitions. [2018-02-02 10:32:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:32:53,825 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:32:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:53,826 INFO L225 Difference]: With dead ends: 387 [2018-02-02 10:32:53,826 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 10:32:53,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=966, Invalid=3324, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:32:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 10:32:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 297. [2018-02-02 10:32:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:32:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 323 transitions. [2018-02-02 10:32:53,829 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 323 transitions. Word has length 62 [2018-02-02 10:32:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:53,829 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 323 transitions. [2018-02-02 10:32:53,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:32:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 323 transitions. [2018-02-02 10:32:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:32:53,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:53,830 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, 1, 1, 1, 1] [2018-02-02 10:32:53,830 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1274243406, now seen corresponding path program 2 times [2018-02-02 10:32:53,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:53,839 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:54,311 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:54,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:54,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:32:54,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:54,311 INFO L182 omatonBuilderFactory]: Interpolants [16320#(or (and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)) (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))), 16321#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 16297#true, 16298#false, 16299#(= |main_#t~malloc3.offset| 0), 16300#(= main_~list~0.offset 0), 16301#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 16302#(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)), 16303#(and (= main_~list~0.offset 0) (= 0 |main_#t~malloc7.offset|) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~list~0.base main_~end~0.base) (= 8 (select |#length| |main_#t~malloc7.base|))), 16304#(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)))), 16305#(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 |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~mem9.base|)) (= (select |#valid| main_~list~0.base) 1)), 16306#(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 main_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 16307#(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))), 16308#(and (= main_~list~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| main_~end~0.base))), 16309#(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)) (= 8 (select |#length| main_~end~0.base))), 16310#(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))) (not (= main_~list~0.base |main_#t~mem16.base|))), 16311#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 16312#(and (or (= main_~list~0.offset |main_#t~malloc7.offset|) (not (= main_~list~0.base |main_#t~malloc7.base|))) (= 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~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset))), 16313#(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))) (or (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)))), 16314#(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))) (or (not (= main_~list~0.base |main_#t~mem9.base|)) (= main_~list~0.offset |main_#t~mem9.offset|))), 16315#(or (and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~0.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_~null~0.offset)) 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))), 16316#(or (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (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))))), 16317#(or (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)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 16318#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (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)))), 16319#(or (and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)) (and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))))] [2018-02-02 10:32:54,311 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:54,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:54,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:54,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:54,312 INFO L87 Difference]: Start difference. First operand 297 states and 323 transitions. Second operand 25 states. [2018-02-02 10:32:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:56,030 INFO L93 Difference]: Finished difference Result 370 states and 400 transitions. [2018-02-02 10:32:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:32:56,031 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 10:32:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:56,031 INFO L225 Difference]: With dead ends: 370 [2018-02-02 10:32:56,031 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 10:32:56,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=739, Invalid=2921, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:32:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 10:32:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 280. [2018-02-02 10:32:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-02 10:32:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 304 transitions. [2018-02-02 10:32:56,034 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 304 transitions. Word has length 62 [2018-02-02 10:32:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:56,035 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 304 transitions. [2018-02-02 10:32:56,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 304 transitions. [2018-02-02 10:32:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:32:56,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:56,035 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:56,035 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:56,035 INFO L82 PathProgramCache]: Analyzing trace with hash -967586565, now seen corresponding path program 1 times [2018-02-02 10:32:56,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:56,043 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:56,349 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:56,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:56,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:32:56,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:56,350 INFO L134 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:56,350 INFO L182 omatonBuilderFactory]: Interpolants [17056#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1))), 17057#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~null~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~malloc14.base|)))), 17058#(or (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 17059#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem16.base|)))), 17060#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))))), 17061#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 17062#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 17063#(not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 17064#(not (= main_~null~0.base |main_#t~mem23.base|)), 17065#(not (= main_~null~0.base main_~end~0.base)), 17044#true, 17045#false, 17046#(= 0 |main_#t~malloc0.offset|), 17047#(= main_~null~0.offset 0), 17048#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 17049#(and (or (not (= main_~null~0.base |main_#t~malloc3.base|)) (= main_~null~0.offset |main_#t~malloc3.offset|)) (or (= main_~null~0.base |main_#t~malloc3.base|) (= (select |#valid| main_~null~0.base) 1))), 17050#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= (select |#valid| main_~null~0.base) 1)), 17051#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= (select |#valid| main_~null~0.base) 1) (= (select |#valid| main_~list~0.base) 1))), 17052#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~null~0.base) 1))), 17053#(or (and (not (= main_~null~0.base |main_#t~malloc7.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 17054#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (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))) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))), 17055#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1)))] [2018-02-02 10:32:56,350 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:56,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:32:56,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:32:56,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:32:56,351 INFO L87 Difference]: Start difference. First operand 280 states and 304 transitions. Second operand 22 states. [2018-02-02 10:32:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:57,481 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-02-02 10:32:57,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:32:57,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-02-02 10:32:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:57,482 INFO L225 Difference]: With dead ends: 322 [2018-02-02 10:32:57,482 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 10:32:57,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=1618, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:32:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 10:32:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2018-02-02 10:32:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-02 10:32:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-02-02 10:32:57,486 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 63 [2018-02-02 10:32:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:57,486 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-02-02 10:32:57,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:32:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-02-02 10:32:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:32:57,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:57,487 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, 1, 1, 1, 1] [2018-02-02 10:32:57,488 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2119274108, now seen corresponding path program 3 times [2018-02-02 10:32:57,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:57,499 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:58,006 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:58,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:58,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:32:58,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:58,007 INFO L134 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:58,007 INFO L182 omatonBuilderFactory]: Interpolants [17728#(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)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 17729#(and (= main_~null~0.offset |main_#t~mem16.offset|) (= main_~null~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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= |main_#t~mem16.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~mem16.base|))), 17730#(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 main_~null~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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~0.offset) (= main_~null~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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 17731#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~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))) (= main_~null~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))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 17732#(and (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~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))) (= main_~null~0.offset (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))) main_~null~0.offset))), 17733#(and (= main_~null~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))) (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~0.offset (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))) main_~null~0.offset))), 17734#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 17735#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset))), 17736#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) main_~null~0.offset))), 17737#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset main_~end~0.offset)), 17738#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 17739#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)), 17740#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)), 17716#true, 17717#false, 17718#(= |main_#t~malloc0.offset| 0), 17719#(= main_~null~0.offset 0), 17720#(and (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 17721#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 17722#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~null~0.offset 0)), 17723#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 17724#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 17725#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 17726#(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) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 17727#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~malloc14.offset|))] [2018-02-02 10:32:58,007 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:58,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:32:58,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:32:58,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:32:58,008 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 25 states. [2018-02-02 10:32:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:59,237 INFO L93 Difference]: Finished difference Result 332 states and 359 transitions. [2018-02-02 10:32:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:32:59,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 10:32:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:59,238 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:32:59,238 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:32:59,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:32:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:32:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 290. [2018-02-02 10:32:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 10:32:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 315 transitions. [2018-02-02 10:32:59,241 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 315 transitions. Word has length 63 [2018-02-02 10:32:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:59,241 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 315 transitions. [2018-02-02 10:32:59,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:32:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 315 transitions. [2018-02-02 10:32:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:32:59,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:59,242 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, 1, 1, 1, 1] [2018-02-02 10:32:59,242 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:32:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1528404354, now seen corresponding path program 2 times [2018-02-02 10:32:59,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:59,252 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:59,467 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:59,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:59,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:32:59,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:59,467 INFO L134 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:59,467 INFO L182 omatonBuilderFactory]: Interpolants [18432#(= 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)))), 18433#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 18434#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 18435#(= 1 (select |#valid| |main_#t~mem21.base|)), 18436#(= 1 (select |#valid| main_~end~0.base)), 18417#true, 18418#false, 18419#(= (select |#valid| main_~list~0.base) 1), 18420#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 18421#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 18422#(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)))), 18423#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 18424#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 18425#(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))), 18426#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset))), 18427#(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))), 18428#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|)) (= |main_#t~mem9.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)))), 18429#(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 main_~null~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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 18430#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 18431#(= 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))))] [2018-02-02 10:32:59,467 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:59,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:32:59,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:32:59,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:32:59,468 INFO L87 Difference]: Start difference. First operand 290 states and 315 transitions. Second operand 20 states. [2018-02-02 10:33:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:00,226 INFO L93 Difference]: Finished difference Result 342 states and 370 transitions. [2018-02-02 10:33:00,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:33:00,226 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-02-02 10:33:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:00,227 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:33:00,227 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:33:00,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:33:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:33:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2018-02-02 10:33:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:33:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 323 transitions. [2018-02-02 10:33:00,229 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 323 transitions. Word has length 64 [2018-02-02 10:33:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:00,230 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 323 transitions. [2018-02-02 10:33:00,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 323 transitions. [2018-02-02 10:33:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:33:00,231 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:00,231 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, 1, 1, 1, 1] [2018-02-02 10:33:00,231 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1528404353, now seen corresponding path program 1 times [2018-02-02 10:33:00,232 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:00,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:00,488 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:33:00,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:00,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:33:00,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:00,488 INFO L134 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:33:00,489 INFO L182 omatonBuilderFactory]: Interpolants [19110#true, 19111#false, 19112#(= (select |#valid| main_~list~0.base) 1), 19113#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 19114#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 19115#(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)))), 19116#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 19117#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 19118#(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))), 19119#(and (= 0 |main_#t~malloc7.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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset)) (= 8 (select |#length| |main_#t~malloc7.base|))), 19120#(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))))), 19121#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.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)))), 19122#(and (not (= main_~end~0.base main_~list~0.base)) (= 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_~null~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_~null~0.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_~null~0.offset)) 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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 19123#(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)))), 19124#(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)))), 19125#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 19126#(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))), 19127#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 19128#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0))] [2018-02-02 10:33:00,489 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:33:00,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:33:00,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:33:00,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:33:00,489 INFO L87 Difference]: Start difference. First operand 297 states and 323 transitions. Second operand 19 states. [2018-02-02 10:33:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:01,321 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-02-02 10:33:01,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:33:01,321 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-02-02 10:33:01,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:01,322 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:33:01,322 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:33:01,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:33:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:33:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 290. [2018-02-02 10:33:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 10:33:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 315 transitions. [2018-02-02 10:33:01,325 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 315 transitions. Word has length 64 [2018-02-02 10:33:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:01,326 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 315 transitions. [2018-02-02 10:33:01,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:33:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 315 transitions. [2018-02-02 10:33:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:33:01,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:01,326 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, 1, 1, 1] [2018-02-02 10:33:01,326 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1404511703, now seen corresponding path program 1 times [2018-02-02 10:33:01,327 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:01,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:01,492 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:33:01,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:01,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:33:01,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:01,493 INFO L134 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:33:01,493 INFO L182 omatonBuilderFactory]: Interpolants [19808#(<= main_~list~0.offset 0), 19809#(and (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 19792#true, 19793#false, 19794#(= (select |#valid| main_~list~0.base) 1), 19795#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 19796#(and (= 0 |main_#t~malloc7.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 19797#(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)))), 19798#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem9.base|))), 19799#(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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 19800#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)), 19801#(and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 19802#(and (= 0 |main_#t~mem23.offset|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem23.offset|)), 19803#(and (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19804#(<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0), 19805#(and (<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19806#(and (<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19807#(<= main_~end~0.offset 0)] [2018-02-02 10:33:01,493 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:33:01,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:33:01,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:33:01,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:33:01,493 INFO L87 Difference]: Start difference. First operand 290 states and 315 transitions. Second operand 18 states. [2018-02-02 10:33:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:02,021 INFO L93 Difference]: Finished difference Result 314 states and 341 transitions. [2018-02-02 10:33:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:33:02,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-02-02 10:33:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:02,022 INFO L225 Difference]: With dead ends: 314 [2018-02-02 10:33:02,022 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 10:33:02,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:33:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 10:33:02,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 297. [2018-02-02 10:33:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:33:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 323 transitions. [2018-02-02 10:33:02,025 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 323 transitions. Word has length 65 [2018-02-02 10:33:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:02,025 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 323 transitions. [2018-02-02 10:33:02,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:33:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 323 transitions. [2018-02-02 10:33:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:33:02,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:02,026 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, 1, 1, 1, 1] [2018-02-02 10:33:02,026 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1560593960, now seen corresponding path program 2 times [2018-02-02 10:33:02,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:02,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:02,511 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:33:02,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:02,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:33:02,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:02,512 INFO L134 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:33:02,512 INFO L182 omatonBuilderFactory]: Interpolants [20449#true, 20450#false, 20451#(= |main_#t~malloc0.offset| 0), 20452#(= main_~null~0.offset 0), 20453#(and (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 20454#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 20455#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~null~0.offset 0)), 20456#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 20457#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 20458#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 20459#(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) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 20460#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~malloc14.offset|)), 20461#(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)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 20462#(and (= main_~null~0.offset |main_#t~mem16.offset|) (= main_~null~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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= |main_#t~mem16.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~mem16.base|))), 20463#(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 main_~null~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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~0.offset) (= main_~null~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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 20464#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~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))) (= main_~null~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))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 20465#(and (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~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))) (= main_~null~0.offset (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))) main_~null~0.offset))), 20466#(and (= main_~null~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))) (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~0.offset (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))) main_~null~0.offset))), 20467#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 20468#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset))), 20469#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) main_~null~0.offset))), 20470#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset main_~end~0.offset)), 20471#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 20472#(and (= main_~null~0.base |main_#t~mem21.base|) (= main_~null~0.offset |main_#t~mem21.offset|)), 20473#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:33:02,512 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:33:02,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:33:02,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:33:02,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:33:02,513 INFO L87 Difference]: Start difference. First operand 297 states and 323 transitions. Second operand 25 states. [2018-02-02 10:33:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:03,911 INFO L93 Difference]: Finished difference Result 350 states and 377 transitions. [2018-02-02 10:33:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:33:03,911 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-02-02 10:33:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:03,912 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:33:03,912 INFO L226 Difference]: Without dead ends: 346 [2018-02-02 10:33:03,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:33:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-02-02 10:33:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 297. [2018-02-02 10:33:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 10:33:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 322 transitions. [2018-02-02 10:33:03,916 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 322 transitions. Word has length 65 [2018-02-02 10:33:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:03,916 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 322 transitions. [2018-02-02 10:33:03,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:33:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 322 transitions. [2018-02-02 10:33:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:33:03,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:03,917 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, 1, 1, 1, 1] [2018-02-02 10:33:03,917 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash 590190000, now seen corresponding path program 1 times [2018-02-02 10:33:03,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:03,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:04,744 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:33:04,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:04,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:33:04,745 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:04,745 INFO L134 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:33:04,745 INFO L182 omatonBuilderFactory]: Interpolants [21184#(and (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset |main_#t~malloc7.offset|) (= main_~end~0.offset main_~list~0.offset) (not (= |main_#t~malloc7.base| 0)) (not (= main_~end~0.base |main_#t~malloc7.base|)) (or (= main_~null~0.base |main_#t~malloc7.base|) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 21185#(and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= 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))) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 21186#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 21187#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (= main_~null~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_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (or (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 21188#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base))), 21189#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (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 (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))) (= main_~end~0.base main_~null~0.base)) (= main_~null~0.offset main_~end~0.offset)), 21190#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (= main_~list~0.base main_~end~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 (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)))) (not (= main_~end~0.base main_~null~0.base))), 21191#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (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 (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)) (not (= main_~list~0.base main_~null~0.base))))), 21192#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base main_~null~0.base)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21193#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 21194#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (and (= 1 (select |#valid| main_~null~0.base)) (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~mem23.base|) (not (= main_~list~0.base main_~null~0.base)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21195#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (or (and (= 1 (select |#valid| main_~null~0.base)) (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) (not (= main_~list~0.base main_~null~0.base))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21196#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base)) (not (= main_~list~0.base main_~null~0.base)) (= main_~null~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_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21197#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~mem27.offset|) (or (and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem27.base|) |main_#t~mem27.offset|))) (= main_~null~0.base |main_#t~mem27.base|))), 21198#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset main_~end~0.offset) (or (and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base main_~end~0.base))), 21199#(and (not (= main_~end~0.base 0)) (or (= main_~null~0.base main_~end~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (= main_~null~0.offset main_~end~0.offset)), 21200#(and (not (= main_~list~0.base 0)) (or (= main_~list~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= main_~list~0.offset main_~null~0.offset)), 21201#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 21202#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem25.base|))), 21203#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 21204#(= 1 (select |#valid| main_~end~0.base)), 21175#true, 21176#false, 21177#(= |main_#t~malloc0.offset| 0), 21178#(= main_~null~0.offset 0), 21179#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 21180#(and (= main_~null~0.offset |main_#t~malloc3.offset|) (= main_~null~0.offset 0) (or (= main_~null~0.base |main_#t~malloc3.base|) (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 |main_#t~malloc3.base|))))), 21181#(and (= main_~null~0.offset main_~list~0.offset) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base)) (= main_~null~0.offset 0)), 21182#(and (= main_~null~0.offset main_~list~0.offset) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 21183#(and (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (or (and (= 1 (select |#valid| main_~null~0.base)) (not (= 0 main_~list~0.base))) (= main_~null~0.base main_~list~0.base)) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0))] [2018-02-02 10:33:04,746 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:33:04,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:33:04,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:33:04,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:33:04,746 INFO L87 Difference]: Start difference. First operand 297 states and 322 transitions. Second operand 30 states. [2018-02-02 10:33:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:07,015 INFO L93 Difference]: Finished difference Result 301 states and 326 transitions. [2018-02-02 10:33:07,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:33:07,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-02-02 10:33:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:07,016 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:33:07,016 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:33:07,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=649, Invalid=3511, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:33:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:33:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2018-02-02 10:33:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 10:33:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 324 transitions. [2018-02-02 10:33:07,019 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 324 transitions. Word has length 66 [2018-02-02 10:33:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:07,019 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 324 transitions. [2018-02-02 10:33:07,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:33:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 324 transitions. [2018-02-02 10:33:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:33:07,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:07,020 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, 1, 1, 1, 1] [2018-02-02 10:33:07,020 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash 590190001, now seen corresponding path program 1 times [2018-02-02 10:33:07,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:07,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:07,607 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:33:07,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:07,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:33:07,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:07,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:33:07,608 INFO L182 omatonBuilderFactory]: Interpolants [21888#(and (= 0 main_~null~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (or (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))))), 21889#(and (= 0 main_~null~0.offset) (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 21890#(and (= 0 main_~null~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~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))), 21891#(and (= 0 main_~null~0.offset) (or (and (= 8 (select |#length| main_~null~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~mem23.base|)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= |main_#t~mem23.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)))), 21892#(and (or (and (= 8 (select |#length| main_~null~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)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= 0 main_~null~0.offset) (= 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)))), 21893#(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))) (or (= 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)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 21894#(and (or (and (= main_~null~0.offset |main_#t~mem27.offset|) (= main_~null~0.base |main_#t~mem27.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem27.base|) |main_#t~mem27.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset|))), 21895#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 21896#(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))) (and (= main_~list~0.base main_~null~0.base) (= main_~list~0.offset main_~null~0.offset)))), 21897#(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)))), 21898#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= 0 |main_#t~mem25.offset|)), 21899#(and (= (select |#length| main_~end~0.base) 8) (= main_~end~0.offset 0)), 21874#true, 21875#false, 21876#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 21877#(and (= 8 (select |#length| main_~null~0.base)) (= main_~null~0.offset 0)), 21878#(and (or (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.base |main_#t~malloc3.base|) (= main_~null~0.offset |main_#t~malloc3.offset|))) (= 0 main_~null~0.offset)), 21879#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base)))), 21880#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base))) (= (select |#valid| main_~list~0.base) 1)), 21881#(and (= 0 main_~null~0.offset) (= (select |#valid| main_~end~0.base) 1) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= 8 (select |#length| main_~null~0.base)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 21882#(and (= 0 main_~null~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset |main_#t~malloc7.offset|) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base |main_#t~malloc7.base|)))), 21883#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 21884#(and (or (and (not (= main_~list~0.base |main_#t~mem9.base|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base))) (= 0 main_~null~0.offset)), 21885#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~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_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))))), 21886#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 8 (select |#length| main_~null~0.base)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 21887#(and (= 0 main_~null~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (or (= 8 (select |#length| main_~null~0.base)) (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)))))] [2018-02-02 10:33:07,608 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:33:07,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:33:07,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:33:07,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:33:07,609 INFO L87 Difference]: Start difference. First operand 298 states and 324 transitions. Second operand 26 states. [2018-02-02 10:33:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:08,994 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-02-02 10:33:08,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:33:08,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-02-02 10:33:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:08,996 INFO L225 Difference]: With dead ends: 389 [2018-02-02 10:33:08,996 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 10:33:08,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=537, Invalid=2325, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:33:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 10:33:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 325. [2018-02-02 10:33:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 10:33:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 361 transitions. [2018-02-02 10:33:08,998 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 361 transitions. Word has length 66 [2018-02-02 10:33:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:08,998 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 361 transitions. [2018-02-02 10:33:08,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:33:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 361 transitions. [2018-02-02 10:33:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:33:08,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:08,999 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, 1, 1, 1, 1] [2018-02-02 10:33:08,999 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1491104568, now seen corresponding path program 1 times [2018-02-02 10:33:09,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:09,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:09,426 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:33:09,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:09,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:33:09,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:09,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:33:09,427 INFO L182 omatonBuilderFactory]: Interpolants [22670#true, 22671#false, 22672#(= |main_#t~malloc0.offset| 0), 22673#(= main_~null~0.offset 0), 22674#(and (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 22675#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 22676#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~null~0.offset 0)), 22677#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 22678#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 22679#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 22680#(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) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 22681#(and (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc14.base|)) (not (= main_~list~0.base |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~malloc14.offset|)), 22682#(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)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 22683#(and (= main_~null~0.offset |main_#t~mem16.offset|) (= main_~null~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 (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|)) (= |main_#t~mem16.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~mem16.base|))), 22684#(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 main_~null~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_~null~0.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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~0.offset) (= main_~null~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_~null~0.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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 22685#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~end~0.offset main_~null~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))) (= main_~null~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))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 22686#(and (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~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))) (= main_~null~0.offset (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))) main_~null~0.offset))), 22687#(and (= main_~null~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))) (= main_~null~0.base (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))) main_~null~0.offset)) (= main_~null~0.offset (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))) main_~null~0.offset))), 22688#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 22689#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) main_~null~0.offset))), 22690#(and (= main_~null~0.offset |main_#t~mem21.offset|) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) main_~null~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) main_~null~0.offset))), 22691#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset main_~end~0.offset)), 22692#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 22693#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)), 22694#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:33:09,427 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:33:09,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:33:09,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:33:09,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:33:09,427 INFO L87 Difference]: Start difference. First operand 325 states and 361 transitions. Second operand 25 states. [2018-02-02 10:33:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:10,579 INFO L93 Difference]: Finished difference Result 358 states and 394 transitions. [2018-02-02 10:33:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:33:10,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2018-02-02 10:33:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:10,580 INFO L225 Difference]: With dead ends: 358 [2018-02-02 10:33:10,580 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 10:33:10,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=354, Invalid=2196, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:33:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 10:33:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 334. [2018-02-02 10:33:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:33:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 370 transitions. [2018-02-02 10:33:10,584 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 370 transitions. Word has length 66 [2018-02-02 10:33:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:10,584 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 370 transitions. [2018-02-02 10:33:10,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:33:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 370 transitions. [2018-02-02 10:33:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:33:10,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:10,584 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, 1, 1, 1, 1] [2018-02-02 10:33:10,584 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -736824932, now seen corresponding path program 1 times [2018-02-02 10:33:10,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:10,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:33:11,116 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:33:11,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:11,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:33:11,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:11,117 INFO L134 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:33:11,117 INFO L182 omatonBuilderFactory]: Interpolants [23439#true, 23440#false, 23441#(= 0 |main_#t~malloc0.offset|), 23442#(= main_~null~0.offset 0), 23443#(and (not (= 0 |main_#t~malloc3.base|)) (= main_~null~0.offset |main_#t~malloc3.offset|) (= |main_#t~malloc3.offset| 0)), 23444#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset)), 23445#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 23446#(and (= main_~list~0.offset 0) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 23447#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~list~0.offset |main_#t~malloc7.offset|) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))), 23448#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~list~0.offset (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))) (= 1 (select |#valid| main_~end~0.base))), 23449#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 23450#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= 1 (select |#valid| 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 23451#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= 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~malloc14.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc14.base|))), 23452#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset 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_~list~0.base) main_~list~0.offset))), 23453#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem16.base|))), 23454#(and (not (= main_~end~0.base main_~list~0.base)) (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 23455#(and (not (= 0 main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 23456#(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)) (= main_~null~0.offset 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))), 23457#(and (not (= 0 main_~list~0.base)) (= main_~list~0.base main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base main_~null~0.base)) (= (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))), 23458#(and (not (= 0 main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem23.base|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) |main_#t~mem23.offset|) |main_#t~mem23.base|) (not (= main_~list~0.base main_~null~0.base))), 23459#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (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)))), 23460#(and (not (= 0 main_~list~0.base)) (or (not (= main_~end~0.base main_~list~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base))) (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))))), 23461#(and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= |main_#t~mem23.base| main_~null~0.base)))), 23462#(and (not (= 0 main_~list~0.base)) (or (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~null~0.base)))), 23463#(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)))), 23464#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem27.base|))), 23465#(and (not (= 0 main_~list~0.base)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 23466#(= 1 (select |#valid| main_~end~0.base)), 23467#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:33:11,117 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:33:11,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:33:11,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:33:11,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:33:11,117 INFO L87 Difference]: Start difference. First operand 334 states and 370 transitions. Second operand 29 states. [2018-02-02 10:33:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:12,794 INFO L93 Difference]: Finished difference Result 370 states and 409 transitions. [2018-02-02 10:33:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:33:12,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-02 10:33:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:12,795 INFO L225 Difference]: With dead ends: 370 [2018-02-02 10:33:12,795 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 10:33:12,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=763, Invalid=3143, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:33:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 10:33:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 345. [2018-02-02 10:33:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 10:33:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 382 transitions. [2018-02-02 10:33:12,798 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 382 transitions. Word has length 67 [2018-02-02 10:33:12,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:12,798 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 382 transitions. [2018-02-02 10:33:12,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:33:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 382 transitions. [2018-02-02 10:33:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:33:12,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:12,798 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, 1, 1, 1, 1, 1] [2018-02-02 10:33:12,798 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:12,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1701588663, now seen corresponding path program 2 times [2018-02-02 10:33:12,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:12,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:13,020 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:33:13,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:13,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:13,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:13,020 INFO L134 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:33:13,020 INFO L182 omatonBuilderFactory]: Interpolants [24256#(and (or (not (= main_~null~0.base |main_#t~malloc3.base|)) (= main_~null~0.offset |main_#t~malloc3.offset|)) (or (= main_~null~0.base |main_#t~malloc3.base|) (= (select |#valid| main_~null~0.base) 1))), 24257#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= (select |#valid| main_~null~0.base) 1)), 24258#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= (select |#valid| main_~null~0.base) 1) (= (select |#valid| main_~list~0.base) 1))), 24259#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~null~0.base) 1))), 24260#(or (and (not (= main_~null~0.base |main_#t~malloc7.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 24261#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (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))) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))), 24262#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1))), 24263#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~list~0.base) 1))), 24264#(or (and (not (= main_~null~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~malloc7.base|)) main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~malloc7.base|))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 24265#(or (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 24266#(or (and (not (= main_~list~0.base |main_#t~mem9.base|)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base))), 24267#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset))))), 24268#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24269#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 24270#(not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 24271#(not (= main_~null~0.base |main_#t~mem23.base|)), 24272#(not (= main_~null~0.base main_~end~0.base)), 24251#true, 24252#false, 24253#(= 0 |main_#t~malloc0.offset|), 24254#(= main_~null~0.offset 0), 24255#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0))] [2018-02-02 10:33:13,021 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:33:13,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:13,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:13,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:13,021 INFO L87 Difference]: Start difference. First operand 345 states and 382 transitions. Second operand 22 states. [2018-02-02 10:33:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:14,123 INFO L93 Difference]: Finished difference Result 424 states and 466 transitions. [2018-02-02 10:33:14,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:33:14,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-02 10:33:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:14,124 INFO L225 Difference]: With dead ends: 424 [2018-02-02 10:33:14,124 INFO L226 Difference]: Without dead ends: 424 [2018-02-02 10:33:14,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=437, Invalid=1543, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:33:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-02 10:33:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2018-02-02 10:33:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-02 10:33:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 410 transitions. [2018-02-02 10:33:14,126 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 410 transitions. Word has length 68 [2018-02-02 10:33:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:14,127 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 410 transitions. [2018-02-02 10:33:14,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 410 transitions. [2018-02-02 10:33:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:33:14,127 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:14,127 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, 1, 1, 1, 1] [2018-02-02 10:33:14,127 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash 549901120, now seen corresponding path program 5 times [2018-02-02 10:33:14,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:14,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:33:14,422 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:33:14,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:14,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:14,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:14,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:33:14,423 INFO L182 omatonBuilderFactory]: Interpolants [25120#(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)))), 25121#(and (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.offset|) (= (select |#valid| main_~list~0.base) 1)), 25122#(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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= 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_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 25123#(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))), 25124#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset))), 25125#(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))), 25126#(and (not (= main_~list~0.base |main_#t~mem9.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~mem9.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|)) (= |main_#t~mem9.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)))), 25127#(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 main_~null~0.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_~null~0.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_~null~0.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_~null~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_~null~0.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_~null~0.offset)) 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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 25128#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 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))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 25129#(and (= main_~null~0.base (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)))) (= main_~null~0.offset (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))))), 25130#(and (= main_~null~0.base (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)))) (= main_~null~0.offset (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))))), 25131#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 25132#(and (= main_~null~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))) (= main_~null~0.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)))), 25133#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 25134#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 25135#(and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)), 25136#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)), 25115#true, 25116#false, 25117#(= (select |#valid| main_~list~0.base) 1), 25118#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 25119#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)))] [2018-02-02 10:33:14,423 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:33:14,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:14,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:14,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:14,423 INFO L87 Difference]: Start difference. First operand 372 states and 410 transitions. Second operand 22 states. [2018-02-02 10:33:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:15,509 INFO L93 Difference]: Finished difference Result 419 states and 459 transitions. [2018-02-02 10:33:15,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:33:15,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-02 10:33:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:15,510 INFO L225 Difference]: With dead ends: 419 [2018-02-02 10:33:15,510 INFO L226 Difference]: Without dead ends: 419 [2018-02-02 10:33:15,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1761, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:33:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-02-02 10:33:15,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 372. [2018-02-02 10:33:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-02 10:33:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 410 transitions. [2018-02-02 10:33:15,513 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 410 transitions. Word has length 68 [2018-02-02 10:33:15,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:15,513 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 410 transitions. [2018-02-02 10:33:15,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:15,513 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 410 transitions. [2018-02-02 10:33:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:33:15,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:15,513 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, 1, 1, 1, 1] [2018-02-02 10:33:15,514 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:15,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1605289183, now seen corresponding path program 3 times [2018-02-02 10:33:15,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:15,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:16,092 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:33:16,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:16,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:33:16,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:16,093 INFO L182 omatonBuilderFactory]: Interpolants [25984#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem9.base|) (= |main_#t~mem9.offset| main_~null~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= (select |#valid| main_~list~0.base) 1)), 25985#(and (= main_~list~0.offset 0) (not (= main_~end~0.base 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= main_~end~0.offset main_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 25986#(and (= main_~list~0.offset 0) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset main_~null~0.offset) (= main_~end~0.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_~null~0.offset) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 25987#(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~malloc7.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc7.base|)) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~end~0.offset main_~null~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~malloc7.offset|)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset)), 25988#(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.offset main_~null~0.offset) (= main_~end~0.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_~null~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)))), 25989#(and (= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem9.base|)) (= (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~mem9.base|)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset))), 25990#(and (= main_~list~0.offset 0) (not (= main_~end~0.base 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~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_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) main_~null~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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) 1) (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 main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 25991#(and (= (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.offset|)) main_~list~0.base) main_~list~0.offset) main_~null~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~malloc14.base|)) main_~list~0.base) main_~list~0.offset) |main_#t~malloc14.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc14.base|)) main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)) (= main_~list~0.offset |main_#t~malloc14.offset|)), 25992#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~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))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 25993#(and (= main_~list~0.offset |main_#t~mem16.offset|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) main_~null~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem16.base|))), 25994#(and (or (and (= 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_~null~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_~null~0.base)) main_~list~0.base) main_~list~0.offset)) main_~null~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 main_~null~0.base)) 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 (and (not (= main_~end~0.base 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 main_~null~0.offset)) main_~list~0.base) main_~list~0.offset) main_~null~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 25995#(and (or (and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)))) (and (= main_~end~0.base main_~list~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (or (and (not (= main_~end~0.base main_~list~0.base)) (= 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_~end~0.base (select (select |#memory_$Pointer$.base| 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) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 25996#(and (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) main_~null~0.offset)))) (or (= 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)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 25997#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 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))))), 25998#(or (and (= main_~null~0.offset |main_#t~mem23.offset|) (= main_~null~0.base |main_#t~mem23.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 25999#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 26000#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 26001#(= 1 (select |#valid| |main_#t~mem23.base|)), 26002#(= 1 (select |#valid| main_~end~0.base)), 25974#true, 25975#false, 25976#(= 0 |main_#t~malloc0.offset|), 25977#(= 0 main_~null~0.offset), 25978#(and (= 0 main_~null~0.offset) (= |main_#t~malloc3.offset| 0)), 25979#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset)), 25980#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= (select |#valid| main_~list~0.base) 1)), 25981#(and (= main_~list~0.offset 0) (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 25982#(and (= main_~list~0.offset 0) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc7.base|)) (= main_~list~0.base main_~end~0.base) (= |main_#t~malloc7.offset| main_~null~0.offset)), 25983#(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))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) main_~null~0.offset))] [2018-02-02 10:33:16,093 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:33:16,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:33:16,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:33:16,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:33:16,093 INFO L87 Difference]: Start difference. First operand 372 states and 410 transitions. Second operand 29 states. Received shutdown request... [2018-02-02 10:33:17,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:33:17,758 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:33:17,763 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:33:17,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:33:17 BoogieIcfgContainer [2018-02-02 10:33:17,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:33:17,763 INFO L168 Benchmark]: Toolchain (without parser) took 52688.94 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 354.6 MB in the beginning and 1.0 GB in the end (delta: -650.8 MB). Peak memory consumption was 170.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:17,764 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:33:17,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.14 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 342.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:17,765 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 397.9 MB. Free memory was 342.6 MB in the beginning and 341.2 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:33:17,765 INFO L168 Benchmark]: RCFGBuilder took 375.60 ms. Allocated memory is still 397.9 MB. Free memory was 341.2 MB in the beginning and 304.1 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:17,765 INFO L168 Benchmark]: TraceAbstraction took 52113.98 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 304.1 MB in the beginning and 1.0 GB in the end (delta: -701.3 MB). Peak memory consumption was 120.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:17,766 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.18 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.14 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 342.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 397.9 MB. Free memory was 342.6 MB in the beginning and 341.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 375.60 ms. Allocated memory is still 397.9 MB. Free memory was 341.2 MB in the beginning and 304.1 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52113.98 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 304.1 MB in the beginning and 1.0 GB in the end (delta: -701.3 MB). Peak memory consumption was 120.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 free always succeeds (line 1063). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1063). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (372states) and interpolant automaton (currently 36 states, 29 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 53 error locations. TIMEOUT Result, 52.0s OverallTime, 52 OverallIterations, 4 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3908 SDtfs, 20960 SDslu, 25994 SDs, 0 SdLazy, 41050 SolverSat, 4209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1733 GetRequests, 141 SyntacticMatches, 58 SemanticMatches, 1533 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13030 ImplicationChecksByTransitivity, 27.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 19/594 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, 51 MinimizatonAttempts, 2130 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2541 NumberOfCodeBlocks, 2541 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2489 ConstructedInterpolants, 0 QuantifiedInterpolants, 2602755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 12 PerfectInterpolantSequences, 19/594 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-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-33-17-773.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-33-17-773.csv Completed graceful shutdown