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-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:32:39,195 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:32:39,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:32:39,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:32:39,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:32:39,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:32:39,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:32:39,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:32:39,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:32:39,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:32:39,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:32:39,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:32:39,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:32:39,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:32:39,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:32:39,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:32:39,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:32:39,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:32:39,224 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:32:39,225 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:32:39,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:32:39,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:32:39,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:32:39,228 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:32:39,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:32:39,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:32:39,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:32:39,230 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:32:39,230 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:32:39,230 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:32:39,231 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:32:39,231 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:39,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:32:39,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:32:39,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:32:39,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:32:39,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:32:39,242 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:32:39,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:32:39,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:32:39,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:32:39,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:32:39,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:32:39,283 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:32:39,286 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:32:39,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:32:39,287 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:32:39,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:32:39,411 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:32:39,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:32:39,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:32:39,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:32:39,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:32:39,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:32:39" (1/1) ... [2018-02-02 10:32:39,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27487fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:39, skipping insertion in model container [2018-02-02 10:32:39,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:32:39" (1/1) ... [2018-02-02 10:32:39,430 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:32:39,459 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:32:39,553 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:32:39,573 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:32:39,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:39 WrapperNode [2018-02-02 10:32:39,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:32:39,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:32:39,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:32:39,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:32:39,590 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:39" (1/1) ... [2018-02-02 10:32:39,590 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:39" (1/1) ... [2018-02-02 10:32:39,597 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:39" (1/1) ... [2018-02-02 10:32:39,597 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:39" (1/1) ... [2018-02-02 10:32:39,601 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:39" (1/1) ... [2018-02-02 10:32:39,605 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:39" (1/1) ... [2018-02-02 10:32:39,606 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:39" (1/1) ... [2018-02-02 10:32:39,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:32:39,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:32:39,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:32:39,609 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:32:39,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:39" (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:39,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:32:39,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:32:39,643 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:32:39,643 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:32:39,643 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:32:39,644 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:32:39,645 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:32:39,645 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:32:39,645 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:32:39,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:32:39,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:32:40,026 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:32:40,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:32:40 BoogieIcfgContainer [2018-02-02 10:32:40,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:32:40,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:32:40,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:32:40,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:32:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:32:39" (1/3) ... [2018-02-02 10:32:40,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1e67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:32:40, skipping insertion in model container [2018-02-02 10:32:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:32:39" (2/3) ... [2018-02-02 10:32:40,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1e67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:32:40, skipping insertion in model container [2018-02-02 10:32:40,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:32:40" (3/3) ... [2018-02-02 10:32:40,034 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:32:40,041 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:32:40,051 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-02-02 10:32:40,081 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:32:40,081 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:32:40,082 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:32:40,082 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:32:40,082 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:32:40,082 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:32:40,082 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:32:40,082 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:32:40,083 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:32:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-02-02 10:32:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:32:40,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:40,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:40,107 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:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1174279352, now seen corresponding path program 1 times [2018-02-02 10:32:40,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:40,193 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,268 INFO L134 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,270 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:40,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:40,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:40,271 INFO L134 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,272 INFO L182 omatonBuilderFactory]: Interpolants [137#true, 138#false, 139#(= 1 (select |#valid| |main_#t~malloc0.base|)), 140#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:32:40,272 INFO L134 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,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:40,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:40,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:40,287 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 4 states. [2018-02-02 10:32:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:40,501 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 10:32:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:32:40,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:32:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:40,509 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:32:40,510 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:32:40,511 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:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:32:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2018-02-02 10:32:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:32:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 10:32:40,548 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 8 [2018-02-02 10:32:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:40,548 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 10:32:40,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 10:32:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:32:40,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:40,549 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:40,549 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:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1174279351, now seen corresponding path program 1 times [2018-02-02 10:32:40,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:40,564 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,636 INFO L134 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,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:40,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:40,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:40,638 INFO L182 omatonBuilderFactory]: Interpolants [417#true, 418#false, 419#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 420#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 10:32:40,638 INFO L134 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,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:40,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:40,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:40,640 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-02-02 10:32:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:40,767 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-02 10:32:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:32:40,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:32:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:40,769 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:32:40,769 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:32:40,770 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:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:32:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:32:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:32:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-02-02 10:32:40,778 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 8 [2018-02-02 10:32:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:40,778 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-02-02 10:32:40,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-02-02 10:32:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:32:40,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:40,779 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:40,779 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:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash -849816279, now seen corresponding path program 1 times [2018-02-02 10:32:40,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:40,799 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,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:40,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:40,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:32:40,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:40,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:40,849 INFO L182 omatonBuilderFactory]: Interpolants [677#true, 678#false, 679#(= (select |#valid| main_~head~0.base) 1), 680#(= (select |#valid| main_~x~0.base) 1)] [2018-02-02 10:32:40,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:40,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:40,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:40,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:40,850 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-02-02 10:32:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:40,958 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-02 10:32:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:40,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:32:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:40,959 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:32:40,960 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:32:40,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:32:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-02-02 10:32:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:32:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-02-02 10:32:40,966 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 15 [2018-02-02 10:32:40,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:40,966 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-02-02 10:32:40,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-02-02 10:32:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:32:40,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:40,967 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:40,967 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:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash -849816278, now seen corresponding path program 1 times [2018-02-02 10:32:40,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:40,983 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,046 INFO L134 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,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:41,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:32:41,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:41,047 INFO L134 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,047 INFO L182 omatonBuilderFactory]: Interpolants [928#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 929#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 930#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 931#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 925#true, 926#false, 927#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-02 10:32:41,047 INFO L134 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,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:32:41,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:32:41,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:41,048 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 7 states. [2018-02-02 10:32:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:41,309 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-02-02 10:32:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:41,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:32:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:41,310 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:32:41,310 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:32:41,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:32:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-02-02 10:32:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:32:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-02-02 10:32:41,316 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 15 [2018-02-02 10:32:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:41,317 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-02-02 10:32:41,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:32:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-02-02 10:32:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:32:41,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:41,317 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:41,318 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:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1955436370, now seen corresponding path program 1 times [2018-02-02 10:32:41,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:41,330 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,361 INFO L134 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,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:41,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:41,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:41,362 INFO L134 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,362 INFO L182 omatonBuilderFactory]: Interpolants [1237#true, 1238#false, 1239#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1240#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1241#(= 1 (select |#valid| |main_#t~mem6.base|)), 1242#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:32:41,362 INFO L134 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,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:41,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:41,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:41,363 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 6 states. [2018-02-02 10:32:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:41,621 INFO L93 Difference]: Finished difference Result 259 states and 283 transitions. [2018-02-02 10:32:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:41,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:32:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:41,623 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:32:41,623 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:32:41,623 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:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:32:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2018-02-02 10:32:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:32:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-02-02 10:32:41,630 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 18 [2018-02-02 10:32:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:41,631 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-02-02 10:32:41,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-02-02 10:32:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:32:41,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:41,632 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:41,632 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:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1955436371, now seen corresponding path program 1 times [2018-02-02 10:32:41,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:41,643 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,690 INFO L134 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,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:41,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:41,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:41,690 INFO L134 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,690 INFO L182 omatonBuilderFactory]: Interpolants [1652#true, 1653#false, 1654#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1655#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1656#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1657#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:32:41,691 INFO L134 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,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:41,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:41,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:41,691 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-02-02 10:32:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:41,936 INFO L93 Difference]: Finished difference Result 254 states and 280 transitions. [2018-02-02 10:32:41,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:41,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:32:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:41,937 INFO L225 Difference]: With dead ends: 254 [2018-02-02 10:32:41,937 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 10:32:41,937 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:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 10:32:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 133. [2018-02-02 10:32:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:32:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-02-02 10:32:41,942 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 18 [2018-02-02 10:32:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:41,943 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-02-02 10:32:41,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-02-02 10:32:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:32:41,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:41,943 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] [2018-02-02 10:32:41,943 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:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash 338517523, now seen corresponding path program 1 times [2018-02-02 10:32:41,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:41,955 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:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:42,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:42,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:32:42,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:42,027 INFO L134 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:42,027 INFO L182 omatonBuilderFactory]: Interpolants [2056#true, 2057#false, 2058#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2059#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2060#(and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0)), 2061#(not |main_#t~short11|)] [2018-02-02 10:32:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:42,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:42,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:42,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:42,028 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 6 states. [2018-02-02 10:32:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:42,141 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-02-02 10:32:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:32:42,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 10:32:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:42,142 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:32:42,142 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:32:42,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 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:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:32:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2018-02-02 10:32:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:32:42,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-02-02 10:32:42,146 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 26 [2018-02-02 10:32:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:42,146 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-02-02 10:32:42,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-02-02 10:32:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:32:42,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:42,147 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:42,147 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:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 244111700, now seen corresponding path program 1 times [2018-02-02 10:32:42,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:42,157 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:42,232 INFO L134 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:42,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:42,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:32:42,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:42,232 INFO L134 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:42,233 INFO L182 omatonBuilderFactory]: Interpolants [2370#true, 2371#false, 2372#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2373#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) |main_#t~short11|), 2374#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2375#(and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0))] [2018-02-02 10:32:42,233 INFO L134 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:42,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:42,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:42,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:42,234 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-02-02 10:32:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:42,398 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2018-02-02 10:32:42,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:42,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:32:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:42,399 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:32:42,399 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:32:42,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:32:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:32:42,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2018-02-02 10:32:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:32:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2018-02-02 10:32:42,403 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 27 [2018-02-02 10:32:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:42,404 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-02-02 10:32:42,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2018-02-02 10:32:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:32:42,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:42,404 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:42,405 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:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 478726098, now seen corresponding path program 1 times [2018-02-02 10:32:42,406 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:42,417 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:42,446 INFO L134 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:42,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:42,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:42,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:42,447 INFO L134 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:42,447 INFO L182 omatonBuilderFactory]: Interpolants [2704#(= 1 (select |#valid| |main_#t~malloc15.base|)), 2705#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2706#(= 1 (select |#valid| |main_#t~mem17.base|)), 2707#(= 1 (select |#valid| main_~x~0.base)), 2702#true, 2703#false] [2018-02-02 10:32:42,448 INFO L134 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:42,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:42,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:42,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:42,448 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 6 states. [2018-02-02 10:32:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:42,615 INFO L93 Difference]: Finished difference Result 214 states and 234 transitions. [2018-02-02 10:32:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:32:42,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:32:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:42,616 INFO L225 Difference]: With dead ends: 214 [2018-02-02 10:32:42,616 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 10:32:42,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 10:32:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 154. [2018-02-02 10:32:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:32:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-02-02 10:32:42,620 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 30 [2018-02-02 10:32:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:42,620 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-02-02 10:32:42,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-02-02 10:32:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:32:42,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:42,621 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:42,621 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:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 478726099, now seen corresponding path program 1 times [2018-02-02 10:32:42,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:42,632 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:42,691 INFO L134 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:42,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:42,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:42,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:42,691 INFO L134 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:42,692 INFO L182 omatonBuilderFactory]: Interpolants [3082#true, 3083#false, 3084#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 3085#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3086#(and (= 8 (select |#length| |main_#t~mem17.base|)) (= 0 |main_#t~mem17.offset|)), 3087#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:32:42,692 INFO L134 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:42,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:32:42,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:32:42,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:32:42,692 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 6 states. [2018-02-02 10:32:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:42,835 INFO L93 Difference]: Finished difference Result 208 states and 230 transitions. [2018-02-02 10:32:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:32:42,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:32:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:42,836 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:32:42,836 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:32:42,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:32:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 152. [2018-02-02 10:32:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:32:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-02-02 10:32:42,839 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 30 [2018-02-02 10:32:42,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:42,839 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-02-02 10:32:42,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:32:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-02-02 10:32:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:32:42,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:42,840 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] [2018-02-02 10:32:42,840 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:42,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1148482263, now seen corresponding path program 1 times [2018-02-02 10:32:42,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:42,852 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:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:42,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:42,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:32:42,977 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:42,977 INFO L134 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:42,977 INFO L182 omatonBuilderFactory]: Interpolants [3456#(= (select |#valid| main_~head~0.base) 1), 3457#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 3458#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 3459#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 3460#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 3461#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 3462#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 3463#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3464#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3465#(= 1 (select |#valid| |main_#t~mem12.base|)), 3466#(= 1 (select |#valid| main_~x~0.base)), 3454#true, 3455#false] [2018-02-02 10:32:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:42,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:32:42,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:32:42,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:32:42,978 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 13 states. [2018-02-02 10:32:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:43,494 INFO L93 Difference]: Finished difference Result 232 states and 254 transitions. [2018-02-02 10:32:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:32:43,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-02-02 10:32:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:43,495 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:32:43,495 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:32:43,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:32:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 174. [2018-02-02 10:32:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:32:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2018-02-02 10:32:43,498 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 35 [2018-02-02 10:32:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:43,498 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2018-02-02 10:32:43,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:32:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2018-02-02 10:32:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:32:43,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:43,498 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] [2018-02-02 10:32:43,499 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:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1148482264, now seen corresponding path program 1 times [2018-02-02 10:32:43,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:43,506 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,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:43,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:43,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:32:43,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:43,690 INFO L182 omatonBuilderFactory]: Interpolants [3904#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3905#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 3906#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 3895#true, 3896#false, 3897#(= (select |#valid| main_~head~0.base) 1), 3898#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 3899#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 3900#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 3901#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3902#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 3903#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:43,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:32:43,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:32:43,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:32:43,691 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand 12 states. [2018-02-02 10:32:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:44,248 INFO L93 Difference]: Finished difference Result 261 states and 287 transitions. [2018-02-02 10:32:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:32:44,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 10:32:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:44,250 INFO L225 Difference]: With dead ends: 261 [2018-02-02 10:32:44,250 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 10:32:44,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 10:32:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 172. [2018-02-02 10:32:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:32:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-02-02 10:32:44,254 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 35 [2018-02-02 10:32:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:44,254 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-02-02 10:32:44,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:32:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-02-02 10:32:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:32:44,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:44,256 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] [2018-02-02 10:32:44,256 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:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -23758126, now seen corresponding path program 1 times [2018-02-02 10:32:44,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:44,268 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,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:44,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:44,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:32:44,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:44,366 INFO L134 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,367 INFO L182 omatonBuilderFactory]: Interpolants [4368#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4369#(= 1 (select |#valid| |main_#t~mem20.base|)), 4358#true, 4359#false, 4360#(= (select |#valid| main_~head~0.base) 1), 4361#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4362#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 4363#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 4364#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 4365#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 4366#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 4367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:44,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:32:44,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:32:44,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:32:44,367 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 12 states. [2018-02-02 10:32:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:44,727 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2018-02-02 10:32:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:32:44,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-02 10:32:44,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:44,728 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:32:44,728 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:32:44,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:44,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:32:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 180. [2018-02-02 10:32:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:32:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-02-02 10:32:44,731 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 36 [2018-02-02 10:32:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:44,731 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-02-02 10:32:44,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:32:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-02-02 10:32:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:32:44,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:44,732 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] [2018-02-02 10:32:44,732 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:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -23758125, now seen corresponding path program 1 times [2018-02-02 10:32:44,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:44,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:44,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:44,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:32:44,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:44,883 INFO L134 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,883 INFO L182 omatonBuilderFactory]: Interpolants [4832#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 4833#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4834#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4835#(and (= (select |#length| |main_#t~mem20.base|) 8) (= |main_#t~mem20.offset| 0)), 4825#true, 4826#false, 4827#(= (select |#valid| main_~head~0.base) 1), 4828#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4829#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4830#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 4831#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:44,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:32:44,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:32:44,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:44,884 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 11 states. [2018-02-02 10:32:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:45,237 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2018-02-02 10:32:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:32:45,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-02-02 10:32:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:45,238 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:32:45,238 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:32:45,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:32:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:32:45,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 180. [2018-02-02 10:32:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:32:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2018-02-02 10:32:45,242 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 36 [2018-02-02 10:32:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:45,242 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2018-02-02 10:32:45,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:32:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2018-02-02 10:32:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:32:45,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:45,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:45,244 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:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1907226184, now seen corresponding path program 1 times [2018-02-02 10:32:45,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:45,256 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:45,280 INFO L134 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:45,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:45,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:32:45,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:45,281 INFO L134 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:45,281 INFO L182 omatonBuilderFactory]: Interpolants [5285#true, 5286#false, 5287#(not (= 0 |main_#t~malloc0.base|)), 5288#(not (= 0 main_~head~0.base)), 5289#(not (= 0 main_~x~0.base))] [2018-02-02 10:32:45,281 INFO L134 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:45,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:32:45,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:32:45,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:32:45,282 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 5 states. [2018-02-02 10:32:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:45,354 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2018-02-02 10:32:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:45,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:32:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:45,355 INFO L225 Difference]: With dead ends: 214 [2018-02-02 10:32:45,355 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 10:32:45,356 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:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 10:32:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-02-02 10:32:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:32:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-02 10:32:45,359 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 38 [2018-02-02 10:32:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:45,359 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-02 10:32:45,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:32:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-02 10:32:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:32:45,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:45,360 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:45,360 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:45,360 INFO L82 PathProgramCache]: Analyzing trace with hash 2006313441, now seen corresponding path program 1 times [2018-02-02 10:32:45,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:45,369 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:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:45,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:45,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:32:45,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:45,466 INFO L182 omatonBuilderFactory]: Interpolants [5696#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base))), 5697#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5698#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5699#(= 1 (select |#valid| |main_#t~mem22.base|)), 5700#(= 1 (select |#valid| main_~next~0.base)), 5701#(= 1 (select |#valid| main_~x~0.base)), 5688#true, 5689#false, 5690#(= (select |#valid| main_~head~0.base) 1), 5691#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5692#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc15.base|)) (= main_~x~0.base main_~head~0.base)), 5693#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5694#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5695#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))] [2018-02-02 10:32:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:45,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:32:45,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:32:45,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:32:45,466 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 14 states. [2018-02-02 10:32:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:45,935 INFO L93 Difference]: Finished difference Result 271 states and 296 transitions. [2018-02-02 10:32:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:32:45,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-02 10:32:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:45,936 INFO L225 Difference]: With dead ends: 271 [2018-02-02 10:32:45,937 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:32:45,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:32:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:32:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 214. [2018-02-02 10:32:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:32:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 238 transitions. [2018-02-02 10:32:45,940 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 238 transitions. Word has length 41 [2018-02-02 10:32:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:45,940 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 238 transitions. [2018-02-02 10:32:45,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:32:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 238 transitions. [2018-02-02 10:32:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:32:45,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:45,940 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:45,941 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:45,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2006313442, now seen corresponding path program 1 times [2018-02-02 10:32:45,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:45,954 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,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:46,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:46,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:32:46,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:46,118 INFO L134 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,118 INFO L182 omatonBuilderFactory]: Interpolants [6211#true, 6212#false, 6213#(= (select |#valid| main_~head~0.base) 1), 6214#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6215#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc15.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc15.offset|)), 6216#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 6217#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6218#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 6219#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6220#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6221#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6222#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6223#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 6224#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 10:32:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:46,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:32:46,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:32:46,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:32:46,118 INFO L87 Difference]: Start difference. First operand 214 states and 238 transitions. Second operand 14 states. [2018-02-02 10:32:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:46,595 INFO L93 Difference]: Finished difference Result 270 states and 297 transitions. [2018-02-02 10:32:46,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:32:46,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-02 10:32:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:46,596 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:32:46,596 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:32:46,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:32:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:32:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2018-02-02 10:32:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:32:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 236 transitions. [2018-02-02 10:32:46,599 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 236 transitions. Word has length 41 [2018-02-02 10:32:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:46,599 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 236 transitions. [2018-02-02 10:32:46,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:32:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2018-02-02 10:32:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:46,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:46,600 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:46,600 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:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1317438644, now seen corresponding path program 1 times [2018-02-02 10:32:46,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:46,606 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,637 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:46,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:46,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:32:46,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:46,638 INFO L134 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,638 INFO L182 omatonBuilderFactory]: Interpolants [6728#true, 6729#false, 6730#(= main_~x~0.base main_~head~0.base), 6731#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 6732#(= 1 (select |#valid| main_~head~0.base)), 6733#(= 1 (select |#valid| main_~x~0.base)), 6734#(= 1 (select |#valid| main_~prev~0.base))] [2018-02-02 10:32:46,638 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:46,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:32:46,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:32:46,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:32:46,638 INFO L87 Difference]: Start difference. First operand 213 states and 236 transitions. Second operand 7 states. [2018-02-02 10:32:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:46,831 INFO L93 Difference]: Finished difference Result 263 states and 288 transitions. [2018-02-02 10:32:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:32:46,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-02-02 10:32:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:46,833 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:32:46,833 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:32:46,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:32:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:32:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 218. [2018-02-02 10:32:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:32:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 245 transitions. [2018-02-02 10:32:46,837 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 245 transitions. Word has length 44 [2018-02-02 10:32:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:46,837 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 245 transitions. [2018-02-02 10:32:46,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:32:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 245 transitions. [2018-02-02 10:32:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:46,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:46,838 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:46,838 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:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1317438645, now seen corresponding path program 1 times [2018-02-02 10:32:46,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:46,848 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,964 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:46,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:46,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:32:46,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:46,965 INFO L134 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,966 INFO L182 omatonBuilderFactory]: Interpolants [7232#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 7233#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7234#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7235#(not (= 0 |main_#t~mem22.base|)), 7236#(not (= 0 main_~next~0.base)), 7237#(not (= 0 main_~x~0.base)), 7225#true, 7226#false, 7227#(= (select |#valid| main_~head~0.base) 1), 7228#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7229#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc15.base|)) (not (= 0 |main_#t~malloc15.base|)) (= main_~x~0.base main_~head~0.base)), 7230#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 7231#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:32:46,966 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:46,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:32:46,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:32:46,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:32:46,966 INFO L87 Difference]: Start difference. First operand 218 states and 245 transitions. Second operand 13 states. [2018-02-02 10:32:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:47,455 INFO L93 Difference]: Finished difference Result 234 states and 260 transitions. [2018-02-02 10:32:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:32:47,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-02 10:32:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:47,456 INFO L225 Difference]: With dead ends: 234 [2018-02-02 10:32:47,456 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:32:47,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:32:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:32:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2018-02-02 10:32:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:32:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 242 transitions. [2018-02-02 10:32:47,459 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 242 transitions. Word has length 44 [2018-02-02 10:32:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:47,459 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 242 transitions. [2018-02-02 10:32:47,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:32:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 242 transitions. [2018-02-02 10:32:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:47,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:47,459 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:47,460 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:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash 958298771, now seen corresponding path program 2 times [2018-02-02 10:32:47,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:47,470 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,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:47,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:47,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:47,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:47,653 INFO L134 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,653 INFO L182 omatonBuilderFactory]: Interpolants [7712#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 7713#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7714#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 7715#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 7716#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 7717#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 7718#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 7719#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 7720#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7721#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7722#(= 1 (select |#valid| |main_#t~mem12.base|)), 7723#(= 1 (select |#valid| main_~x~0.base)), 7708#true, 7709#false, 7710#(= (select |#valid| main_~head~0.base) 1), 7711#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:32:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:47,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:47,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:47,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:47,654 INFO L87 Difference]: Start difference. First operand 216 states and 242 transitions. Second operand 16 states. [2018-02-02 10:32:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:48,390 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2018-02-02 10:32:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:32:48,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-02 10:32:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:48,391 INFO L225 Difference]: With dead ends: 323 [2018-02-02 10:32:48,391 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 10:32:48,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 10:32:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 238. [2018-02-02 10:32:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 10:32:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 268 transitions. [2018-02-02 10:32:48,394 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 268 transitions. Word has length 44 [2018-02-02 10:32:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:48,394 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 268 transitions. [2018-02-02 10:32:48,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 268 transitions. [2018-02-02 10:32:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:32:48,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:48,395 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:48,395 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:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 958298772, now seen corresponding path program 2 times [2018-02-02 10:32:48,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:48,402 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:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:48,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:48,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:32:48,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:48,631 INFO L134 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:48,631 INFO L182 omatonBuilderFactory]: Interpolants [8320#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8321#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 8322#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8323#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8324#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8325#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 8326#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 8327#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8328#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8329#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8330#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8331#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8332#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 8333#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 8317#true, 8318#false, 8319#(= (select |#valid| main_~head~0.base) 1)] [2018-02-02 10:32:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:48,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:32:48,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:32:48,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:32:48,632 INFO L87 Difference]: Start difference. First operand 238 states and 268 transitions. Second operand 17 states. [2018-02-02 10:32:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:49,350 INFO L93 Difference]: Finished difference Result 342 states and 378 transitions. [2018-02-02 10:32:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:32:49,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-02 10:32:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:49,351 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:32:49,351 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:32:49,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:32:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:32:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 231. [2018-02-02 10:32:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:32:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 260 transitions. [2018-02-02 10:32:49,353 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 260 transitions. Word has length 44 [2018-02-02 10:32:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:49,353 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 260 transitions. [2018-02-02 10:32:49,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:32:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 260 transitions. [2018-02-02 10:32:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:32:49,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:49,354 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:32:49,354 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:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 153357927, now seen corresponding path program 3 times [2018-02-02 10:32:49,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:49,360 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,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:49,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:49,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:49,533 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:49,533 INFO L134 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,533 INFO L182 omatonBuilderFactory]: Interpolants [8935#true, 8936#false, 8937#(= (select |#valid| main_~head~0.base) 1), 8938#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8939#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 8940#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 8941#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|)), 8942#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 8943#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8944#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8945#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 8946#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 8947#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8948#(and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0)), 8949#(not |main_#t~short11|)] [2018-02-02 10:32:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:49,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:49,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:49,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:49,534 INFO L87 Difference]: Start difference. First operand 231 states and 260 transitions. Second operand 15 states. [2018-02-02 10:32:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:50,047 INFO L93 Difference]: Finished difference Result 276 states and 305 transitions. [2018-02-02 10:32:50,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:32:50,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:32:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:50,048 INFO L225 Difference]: With dead ends: 276 [2018-02-02 10:32:50,048 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 10:32:50,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 10:32:50,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 240. [2018-02-02 10:32:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:32:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2018-02-02 10:32:50,051 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 45 [2018-02-02 10:32:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:50,051 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2018-02-02 10:32:50,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2018-02-02 10:32:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:32:50,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:50,052 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:32:50,052 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:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1624479082, now seen corresponding path program 2 times [2018-02-02 10:32:50,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:50,060 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:50,188 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:50,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:50,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:32:50,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:50,188 INFO L134 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:50,188 INFO L182 omatonBuilderFactory]: Interpolants [9504#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 9505#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 9506#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9507#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9508#(= 1 (select |#valid| |main_#t~mem20.base|)), 9494#true, 9495#false, 9496#(= (select |#valid| main_~head~0.base) 1), 9497#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9498#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 9499#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9500#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 9501#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 9502#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 9503#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:32:50,189 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:50,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:50,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:50,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:50,189 INFO L87 Difference]: Start difference. First operand 240 states and 269 transitions. Second operand 15 states. [2018-02-02 10:32:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:50,709 INFO L93 Difference]: Finished difference Result 322 states and 355 transitions. [2018-02-02 10:32:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:32:50,709 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:32:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:50,710 INFO L225 Difference]: With dead ends: 322 [2018-02-02 10:32:50,710 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 10:32:50,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:32:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 10:32:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 248. [2018-02-02 10:32:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:32:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 279 transitions. [2018-02-02 10:32:50,712 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 279 transitions. Word has length 45 [2018-02-02 10:32:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:50,712 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 279 transitions. [2018-02-02 10:32:50,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 279 transitions. [2018-02-02 10:32:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:32:50,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:50,713 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 10:32:50,713 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:50,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1624479081, now seen corresponding path program 2 times [2018-02-02 10:32:50,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:50,721 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:50,922 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:50,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:50,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:50,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:50,922 INFO L134 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:50,923 INFO L182 omatonBuilderFactory]: Interpolants [10112#false, 10113#(= (select |#valid| main_~head~0.base) 1), 10114#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10115#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 10116#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10117#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10118#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10119#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 10120#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 10121#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10122#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10123#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10124#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10125#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10126#(and (= (select |#length| |main_#t~mem20.base|) 8) (= |main_#t~mem20.offset| 0)), 10111#true] [2018-02-02 10:32:50,923 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:50,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:50,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:50,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:50,923 INFO L87 Difference]: Start difference. First operand 248 states and 279 transitions. Second operand 16 states. [2018-02-02 10:32:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:51,519 INFO L93 Difference]: Finished difference Result 312 states and 345 transitions. [2018-02-02 10:32:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:32:51,519 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-02-02 10:32:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:51,520 INFO L225 Difference]: With dead ends: 312 [2018-02-02 10:32:51,520 INFO L226 Difference]: Without dead ends: 312 [2018-02-02 10:32:51,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:32:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-02-02 10:32:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 240. [2018-02-02 10:32:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:32:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 269 transitions. [2018-02-02 10:32:51,523 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 269 transitions. Word has length 45 [2018-02-02 10:32:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:51,523 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 269 transitions. [2018-02-02 10:32:51,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 269 transitions. [2018-02-02 10:32:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:32:51,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:51,523 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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:51,524 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:51,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1938050059, now seen corresponding path program 2 times [2018-02-02 10:32:51,524 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:51,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:32:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:51,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:51,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:32:51,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:51,803 INFO L134 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:51,803 INFO L182 omatonBuilderFactory]: Interpolants [10720#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|)), 10721#(and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 10722#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 10705#true, 10706#false, 10707#(= (select |#valid| main_~head~0.base) 1), 10708#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10709#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc15.base|)) (= main_~x~0.base main_~head~0.base)), 10710#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10711#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem17.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem17.base|)), 10712#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 10713#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10714#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 10715#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 10716#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem22.base|) |main_#t~mem22.offset|))), 10717#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) main_~next~0.base) main_~next~0.offset))), 10718#(and (= 0 (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~next~0.base) main_~next~0.offset))), 10719#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:32:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:51,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:32:51,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:32:51,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:32:51,814 INFO L87 Difference]: Start difference. First operand 240 states and 269 transitions. Second operand 18 states. [2018-02-02 10:32:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:52,503 INFO L93 Difference]: Finished difference Result 307 states and 344 transitions. [2018-02-02 10:32:52,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:32:52,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 10:32:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:52,505 INFO L225 Difference]: With dead ends: 307 [2018-02-02 10:32:52,505 INFO L226 Difference]: Without dead ends: 307 [2018-02-02 10:32:52,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:32:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-02-02 10:32:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 248. [2018-02-02 10:32:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:32:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2018-02-02 10:32:52,511 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 47 [2018-02-02 10:32:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:52,511 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2018-02-02 10:32:52,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:32:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2018-02-02 10:32:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:32:52,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:52,512 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:52,512 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:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1300298452, now seen corresponding path program 1 times [2018-02-02 10:32:52,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:52,520 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,644 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:52,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:52,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:32:52,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:52,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:52,645 INFO L182 omatonBuilderFactory]: Interpolants [11312#true, 11313#false, 11314#(= (select |#valid| main_~head~0.base) 1), 11315#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11316#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11317#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11318#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 11319#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 11320#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 11321#(and (not (= |main_#t~mem20.base| main_~head~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 11322#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 11323#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11324#(= 1 (select |#valid| |main_#t~mem22.base|)), 11325#(= 1 (select |#valid| main_~next~0.base)), 11326#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:32:52,645 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:52,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:52,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:52,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:52,646 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand 15 states. [2018-02-02 10:32:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:53,185 INFO L93 Difference]: Finished difference Result 339 states and 374 transitions. [2018-02-02 10:32:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:32:53,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-02 10:32:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:53,186 INFO L225 Difference]: With dead ends: 339 [2018-02-02 10:32:53,186 INFO L226 Difference]: Without dead ends: 339 [2018-02-02 10:32:53,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:32:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-02 10:32:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 267. [2018-02-02 10:32:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 10:32:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 299 transitions. [2018-02-02 10:32:53,199 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 299 transitions. Word has length 47 [2018-02-02 10:32:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:53,199 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 299 transitions. [2018-02-02 10:32:53,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 299 transitions. [2018-02-02 10:32:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:32:53,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:53,200 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:53,200 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:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1300298451, now seen corresponding path program 1 times [2018-02-02 10:32:53,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:53,208 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:53,423 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:53,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:53,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:32:53,424 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:53,424 INFO L134 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:53,424 INFO L182 omatonBuilderFactory]: Interpolants [11968#false, 11969#(= (select |#valid| main_~head~0.base) 1), 11970#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11971#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 11972#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 11973#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11974#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 11975#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11976#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem20.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11977#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11978#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11979#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11980#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11981#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 11982#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 11967#true] [2018-02-02 10:32:53,424 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:53,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:32:53,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:32:53,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:32:53,425 INFO L87 Difference]: Start difference. First operand 267 states and 299 transitions. Second operand 16 states. [2018-02-02 10:32:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:54,230 INFO L93 Difference]: Finished difference Result 342 states and 381 transitions. [2018-02-02 10:32:54,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:32:54,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-02-02 10:32:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:54,256 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:32:54,256 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:32:54,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:32:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:32:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 266. [2018-02-02 10:32:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 10:32:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 297 transitions. [2018-02-02 10:32:54,258 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 297 transitions. Word has length 47 [2018-02-02 10:32:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:54,259 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 297 transitions. [2018-02-02 10:32:54,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:32:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 297 transitions. [2018-02-02 10:32:54,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:32:54,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:54,259 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:54,259 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:54,259 INFO L82 PathProgramCache]: Analyzing trace with hash 794661409, now seen corresponding path program 2 times [2018-02-02 10:32:54,260 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:54,266 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,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:54,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:54,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:32:54,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:54,477 INFO L134 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,477 INFO L182 omatonBuilderFactory]: Interpolants [12615#true, 12616#false, 12617#(= (select |#valid| main_~head~0.base) 1), 12618#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12619#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc15.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc15.offset|)), 12620#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 12621#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12622#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 12623#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12624#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12625#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12626#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12627#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 12628#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 12629#(and (<= 0 main_~prev~0.offset) (<= main_~prev~0.offset 0) (= 8 (select |#length| main_~prev~0.base)))] [2018-02-02 10:32:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:54,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:32:54,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:32:54,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:32:54,478 INFO L87 Difference]: Start difference. First operand 266 states and 297 transitions. Second operand 15 states. [2018-02-02 10:32:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:55,016 INFO L93 Difference]: Finished difference Result 344 states and 384 transitions. [2018-02-02 10:32:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:32:55,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-02-02 10:32:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:55,017 INFO L225 Difference]: With dead ends: 344 [2018-02-02 10:32:55,017 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 10:32:55,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:32:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 10:32:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 282. [2018-02-02 10:32:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:32:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 318 transitions. [2018-02-02 10:32:55,020 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 318 transitions. Word has length 50 [2018-02-02 10:32:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:55,020 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 318 transitions. [2018-02-02 10:32:55,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:32:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 318 transitions. [2018-02-02 10:32:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:32:55,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:55,020 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:55,021 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:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash -882531958, now seen corresponding path program 1 times [2018-02-02 10:32:55,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:55,026 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:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:55,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:55,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:32:55,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:55,124 INFO L134 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:55,124 INFO L182 omatonBuilderFactory]: Interpolants [13280#true, 13281#false, 13282#(= 0 |main_#t~malloc0.offset|), 13283#(= 0 main_~head~0.offset), 13284#(and (= 0 main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 13285#(and (= 0 main_~head~0.offset) (<= 0 main_~x~0.offset) (= main_~x~0.base main_~head~0.base)), 13286#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 13287#(and (= 0 main_~head~0.offset) (<= 8 (select |#length| main_~head~0.base))), 13288#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 13289#(and (= 0 main_~prev~0.offset) (<= 8 (select |#length| main_~prev~0.base)))] [2018-02-02 10:32:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:32:55,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:32:55,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:32:55,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:32:55,125 INFO L87 Difference]: Start difference. First operand 282 states and 318 transitions. Second operand 10 states. [2018-02-02 10:32:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:55,358 INFO L93 Difference]: Finished difference Result 382 states and 425 transitions. [2018-02-02 10:32:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:32:55,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-02 10:32:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:55,359 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:32:55,359 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:32:55,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:32:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:32:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 328. [2018-02-02 10:32:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:32:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 384 transitions. [2018-02-02 10:32:55,363 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 384 transitions. Word has length 50 [2018-02-02 10:32:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:55,363 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 384 transitions. [2018-02-02 10:32:55,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:32:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 384 transitions. [2018-02-02 10:32:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:32:55,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:55,363 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:55,364 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:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash -101775316, now seen corresponding path program 1 times [2018-02-02 10:32:55,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:55,369 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:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:55,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:32:55,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:32:55,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:55,408 INFO L134 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:55,408 INFO L182 omatonBuilderFactory]: Interpolants [14016#(or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base))), 14017#(or (not (= 0 main_~prev~0.offset)) (not (= 0 main_~prev~0.base))), 14014#true, 14015#false] [2018-02-02 10:32:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:32:55,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:32:55,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:32:55,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:32:55,409 INFO L87 Difference]: Start difference. First operand 328 states and 384 transitions. Second operand 4 states. [2018-02-02 10:32:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:55,480 INFO L93 Difference]: Finished difference Result 332 states and 384 transitions. [2018-02-02 10:32:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:32:55,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-02-02 10:32:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:55,481 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:32:55,481 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:32:55,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:32:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2018-02-02 10:32:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:32:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 381 transitions. [2018-02-02 10:32:55,486 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 381 transitions. Word has length 53 [2018-02-02 10:32:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:55,486 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 381 transitions. [2018-02-02 10:32:55,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:32:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 381 transitions. [2018-02-02 10:32:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:32:55,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:55,487 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:55,487 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:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash -61347072, now seen corresponding path program 2 times [2018-02-02 10:32:55,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:55,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:55,950 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:55,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:55,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:32:55,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:55,951 INFO L134 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:55,951 INFO L182 omatonBuilderFactory]: Interpolants [14688#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 14689#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14690#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14691#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 14692#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem20.base| main_~head~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (+ |main_#t~mem20.offset| 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 14693#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 14694#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 14695#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem22.base|) |main_#t~mem22.offset|))), 14696#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) main_~next~0.base) main_~next~0.offset))), 14697#(and (= 0 (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~next~0.base) main_~next~0.offset))), 14698#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 14699#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|)), 14700#(and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 14701#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 14681#true, 14682#false, 14683#(= (select |#valid| main_~head~0.base) 1), 14684#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14685#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 14686#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14687#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))] [2018-02-02 10:32:55,952 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:55,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:32:55,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:32:55,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:55,952 INFO L87 Difference]: Start difference. First operand 328 states and 381 transitions. Second operand 21 states. [2018-02-02 10:32:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:57,075 INFO L93 Difference]: Finished difference Result 463 states and 532 transitions. [2018-02-02 10:32:57,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:32:57,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-02-02 10:32:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:57,077 INFO L225 Difference]: With dead ends: 463 [2018-02-02 10:32:57,077 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 10:32:57,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:32:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 10:32:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 331. [2018-02-02 10:32:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 10:32:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 384 transitions. [2018-02-02 10:32:57,082 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 384 transitions. Word has length 53 [2018-02-02 10:32:57,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:57,082 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 384 transitions. [2018-02-02 10:32:57,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:32:57,082 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 384 transitions. [2018-02-02 10:32:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:32:57,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:57,083 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:57,083 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:57,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1270572631, now seen corresponding path program 4 times [2018-02-02 10:32:57,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:57,096 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:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:57,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:57,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:32:57,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:57,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:57,404 INFO L182 omatonBuilderFactory]: Interpolants [15552#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 15553#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15554#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15555#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 15556#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15557#(= 1 (select |#valid| |main_#t~mem12.base|)), 15558#(= 1 (select |#valid| main_~x~0.base)), 15538#true, 15539#false, 15540#(= (select |#valid| main_~head~0.base) 1), 15541#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15542#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 15543#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15544#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 15545#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 15546#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15547#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 15548#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 15549#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 15550#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 15551#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))))] [2018-02-02 10:32:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:57,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:32:57,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:32:57,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:32:57,404 INFO L87 Difference]: Start difference. First operand 331 states and 384 transitions. Second operand 21 states. [2018-02-02 10:32:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:32:58,121 INFO L93 Difference]: Finished difference Result 372 states and 424 transitions. [2018-02-02 10:32:58,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:32:58,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-02-02 10:32:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:32:58,124 INFO L225 Difference]: With dead ends: 372 [2018-02-02 10:32:58,124 INFO L226 Difference]: Without dead ends: 372 [2018-02-02 10:32:58,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1176, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:32:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-02 10:32:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 338. [2018-02-02 10:32:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:32:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 392 transitions. [2018-02-02 10:32:58,130 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 392 transitions. Word has length 53 [2018-02-02 10:32:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:32:58,130 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 392 transitions. [2018-02-02 10:32:58,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:32:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 392 transitions. [2018-02-02 10:32:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:32:58,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:32:58,131 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:32:58,131 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:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1270572632, now seen corresponding path program 3 times [2018-02-02 10:32:58,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:32:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:32:58,146 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,634 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:58,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:32:58,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:32:58,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:32:58,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:58,635 INFO L182 omatonBuilderFactory]: Interpolants [16320#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 16321#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16322#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 16323#(or (and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 16324#(or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base main_~head~0.base)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 16325#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 16326#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 16327#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0))), 16328#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not |main_#t~short11|)), 16329#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 16330#(and (= 0 |main_#t~mem12.offset|) (<= 8 (select |#length| |main_#t~mem12.base|))), 16331#(and (= main_~x~0.offset 0) (<= 8 (select |#length| main_~x~0.base))), 16305#true, 16306#false, 16307#(= |main_#t~malloc0.offset| 0), 16308#(= main_~head~0.offset 0), 16309#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 16310#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 16311#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 16312#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 16313#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 16314#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 16315#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 16316#(and (= (select |#length| main_~x~0.base) 8) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 16317#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 16318#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16319#(and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:32:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:32:58,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:32:58,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:32:58,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:32:58,636 INFO L87 Difference]: Start difference. First operand 338 states and 392 transitions. Second operand 27 states. [2018-02-02 10:33:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:00,457 INFO L93 Difference]: Finished difference Result 430 states and 486 transitions. [2018-02-02 10:33:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:33:00,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-02-02 10:33:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:00,458 INFO L225 Difference]: With dead ends: 430 [2018-02-02 10:33:00,458 INFO L226 Difference]: Without dead ends: 430 [2018-02-02 10:33:00,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=813, Invalid=3347, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:33:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-02-02 10:33:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 331. [2018-02-02 10:33:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-02 10:33:00,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 384 transitions. [2018-02-02 10:33:00,462 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 384 transitions. Word has length 53 [2018-02-02 10:33:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:00,462 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 384 transitions. [2018-02-02 10:33:00,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:33:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 384 transitions. [2018-02-02 10:33:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:00,463 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:00,463 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:00,463 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:33:00,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1145624742, now seen corresponding path program 1 times [2018-02-02 10:33:00,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:00,468 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,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:00,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:00,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:33:00,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:00,506 INFO L134 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,506 INFO L182 omatonBuilderFactory]: Interpolants [17169#true, 17170#false, 17171#(= main_~x~0.base main_~head~0.base), 17172#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 17173#(= 1 (select |#valid| main_~head~0.base)), 17174#(= 1 (select |#valid| main_~x~0.base)), 17175#(= 1 (select |#valid| main_~prev~0.base)), 17176#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17177#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 17178#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 10:33:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:00,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:33:00,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:33:00,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:00,506 INFO L87 Difference]: Start difference. First operand 331 states and 384 transitions. Second operand 10 states. [2018-02-02 10:33:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:00,773 INFO L93 Difference]: Finished difference Result 389 states and 426 transitions. [2018-02-02 10:33:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:33:00,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 10:33:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:00,774 INFO L225 Difference]: With dead ends: 389 [2018-02-02 10:33:00,774 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 10:33:00,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:33:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 10:33:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 335. [2018-02-02 10:33:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 10:33:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 390 transitions. [2018-02-02 10:33:00,779 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 390 transitions. Word has length 54 [2018-02-02 10:33:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:00,779 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 390 transitions. [2018-02-02 10:33:00,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:33:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 390 transitions. [2018-02-02 10:33:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:00,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:00,780 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:00,780 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:33:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1145624743, now seen corresponding path program 1 times [2018-02-02 10:33:00,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:00,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:00,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:00,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:33:00,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:00,926 INFO L134 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,926 INFO L182 omatonBuilderFactory]: Interpolants [17936#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 17937#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17938#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 17939#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 17940#(and (= 0 main_~prev~0.offset) (<= 8 (select |#length| main_~prev~0.base))), 17941#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17942#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset))), 17943#(and (= |main_#t~mem25.offset| 0) (<= 8 (select |#length| |main_#t~mem25.base|))), 17932#true, 17933#false, 17934#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 17935#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)))] [2018-02-02 10:33:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:00,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:33:00,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:33:00,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:33:00,927 INFO L87 Difference]: Start difference. First operand 335 states and 390 transitions. Second operand 12 states. [2018-02-02 10:33:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:01,304 INFO L93 Difference]: Finished difference Result 441 states and 495 transitions. [2018-02-02 10:33:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:33:01,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-02-02 10:33:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:01,305 INFO L225 Difference]: With dead ends: 441 [2018-02-02 10:33:01,305 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 10:33:01,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 10:33:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 349. [2018-02-02 10:33:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 10:33:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 410 transitions. [2018-02-02 10:33:01,308 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 410 transitions. Word has length 54 [2018-02-02 10:33:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:01,309 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 410 transitions. [2018-02-02 10:33:01,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:33:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 410 transitions. [2018-02-02 10:33:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:01,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:01,309 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:01,309 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:33:01,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1970867087, now seen corresponding path program 1 times [2018-02-02 10:33:01,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:01,316 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,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:01,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:01,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:01,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:01,693 INFO L134 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,693 INFO L182 omatonBuilderFactory]: Interpolants [18754#true, 18755#false, 18756#(= 0 (select |#valid| 0)), 18757#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0))), 18758#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base)), 18759#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (or (not (= |main_#t~malloc4.base| main_~x~0.base)) (= 1 (select |#valid| 0)))), 18760#(and (or (= 1 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 18761#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (or (= 1 (select |#valid| 0)) (not (= |main_#t~mem6.base| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18762#(or (and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 18763#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 18764#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| 0))), 18765#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem14.offset| 0) (= main_~x~0.base main_~head~0.base) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 18766#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| 0))), 18767#(or (and (not (= |main_#t~mem20.base| main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (= 1 (select |#valid| 0))), 18768#(or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| 0))), 18769#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0))), 18770#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18771#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= main_~next~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18772#(or (not (= main_~next~0.base 0)) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 18773#(or (not (= main_~x~0.base 0)) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)))), 18774#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 18775#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 18776#(= (select |#valid| |main_#t~mem25.base|) 1)] [2018-02-02 10:33:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:01,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:01,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:01,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:01,694 INFO L87 Difference]: Start difference. First operand 349 states and 410 transitions. Second operand 23 states. [2018-02-02 10:33:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:02,819 INFO L93 Difference]: Finished difference Result 370 states and 429 transitions. [2018-02-02 10:33:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:33:02,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-02-02 10:33:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:02,820 INFO L225 Difference]: With dead ends: 370 [2018-02-02 10:33:02,820 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 10:33:02,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:33:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 10:33:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 349. [2018-02-02 10:33:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-02-02 10:33:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 409 transitions. [2018-02-02 10:33:02,824 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 409 transitions. Word has length 54 [2018-02-02 10:33:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:02,825 INFO L432 AbstractCegarLoop]: Abstraction has 349 states and 409 transitions. [2018-02-02 10:33:02,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 409 transitions. [2018-02-02 10:33:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:02,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:02,825 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:02,826 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:33:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1243912995, now seen corresponding path program 5 times [2018-02-02 10:33:02,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:02,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:03,081 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:33:03,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:03,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:33:03,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:03,081 INFO L134 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:03,082 INFO L182 omatonBuilderFactory]: Interpolants [19530#true, 19531#false, 19532#(= (select |#valid| main_~head~0.base) 1), 19533#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19534#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19535#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19536#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19537#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 19538#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 19539#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 19540#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 19541#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19542#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 19543#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 19544#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 19545#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 19546#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 19547#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 19548#(= 1 (select |#valid| |main_#t~mem12.base|)), 19549#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:03,082 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:33:03,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:33:03,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:33:03,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:33:03,082 INFO L87 Difference]: Start difference. First operand 349 states and 409 transitions. Second operand 20 states. [2018-02-02 10:33:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:04,123 INFO L93 Difference]: Finished difference Result 435 states and 500 transitions. [2018-02-02 10:33:04,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:33:04,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-02-02 10:33:04,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:04,124 INFO L225 Difference]: With dead ends: 435 [2018-02-02 10:33:04,124 INFO L226 Difference]: Without dead ends: 435 [2018-02-02 10:33:04,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:33:04,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-02-02 10:33:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 366. [2018-02-02 10:33:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 10:33:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 429 transitions. [2018-02-02 10:33:04,127 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 429 transitions. Word has length 54 [2018-02-02 10:33:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:04,127 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 429 transitions. [2018-02-02 10:33:04,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 429 transitions. [2018-02-02 10:33:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:04,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:04,128 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:04,128 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:33:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1243912996, now seen corresponding path program 4 times [2018-02-02 10:33:04,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:04,135 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,380 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:33:04,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:04,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:33:04,381 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:04,381 INFO L182 omatonBuilderFactory]: Interpolants [20389#true, 20390#false, 20391#(= (select |#valid| main_~head~0.base) 1), 20392#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20393#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 20394#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20395#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20396#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 20397#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 20398#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20399#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 20400#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 20401#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 20402#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 20403#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 20404#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 20405#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20406#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 20407#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:33:04,381 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:33:04,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:33:04,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:33:04,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:33:04,382 INFO L87 Difference]: Start difference. First operand 366 states and 429 transitions. Second operand 19 states. [2018-02-02 10:33:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:05,338 INFO L93 Difference]: Finished difference Result 464 states and 533 transitions. [2018-02-02 10:33:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:33:05,338 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-02 10:33:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:05,339 INFO L225 Difference]: With dead ends: 464 [2018-02-02 10:33:05,339 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 10:33:05,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:33:05,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 10:33:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 359. [2018-02-02 10:33:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:33:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2018-02-02 10:33:05,342 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 54 [2018-02-02 10:33:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:05,342 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2018-02-02 10:33:05,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:33:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2018-02-02 10:33:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:05,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:05,343 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 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:05,343 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:33:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash -533924014, now seen corresponding path program 3 times [2018-02-02 10:33:05,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:05,352 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:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:05,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:05,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:33:05,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:05,670 INFO L134 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:05,671 INFO L182 omatonBuilderFactory]: Interpolants [21280#(= 1 (select |#valid| |main_#t~mem20.base|)), 21261#true, 21262#false, 21263#(= (select |#valid| main_~head~0.base) 1), 21264#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21265#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 21266#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 21267#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 21268#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 21269#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 21270#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 21271#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 21272#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 21273#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21274#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 21275#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 21276#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 21277#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 21278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 21279#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:05,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:33:05,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:33:05,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:33:05,671 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand 20 states. [2018-02-02 10:33:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:06,407 INFO L93 Difference]: Finished difference Result 395 states and 457 transitions. [2018-02-02 10:33:06,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:33:06,407 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-02-02 10:33:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:06,408 INFO L225 Difference]: With dead ends: 395 [2018-02-02 10:33:06,408 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 10:33:06,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1080, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:33:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 10:33:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2018-02-02 10:33:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 10:33:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 424 transitions. [2018-02-02 10:33:06,411 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 424 transitions. Word has length 54 [2018-02-02 10:33:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:06,411 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 424 transitions. [2018-02-02 10:33:06,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 424 transitions. [2018-02-02 10:33:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:33:06,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:06,411 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 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:06,411 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:33:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -533924013, now seen corresponding path program 3 times [2018-02-02 10:33:06,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:06,421 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:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:06,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:06,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:33:06,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:06,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:33:06,679 INFO L182 omatonBuilderFactory]: Interpolants [22080#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 22081#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 22082#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22083#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 22084#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 22085#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22086#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22087#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 22088#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 22089#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 22090#(and (= (select |#length| |main_#t~mem20.base|) 8) (= |main_#t~mem20.offset| 0)), 22071#true, 22072#false, 22073#(= (select |#valid| main_~head~0.base) 1), 22074#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22075#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 22076#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22077#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 22078#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 22079#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:33:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:06,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:33:06,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:33:06,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:33:06,680 INFO L87 Difference]: Start difference. First operand 361 states and 424 transitions. Second operand 20 states. [2018-02-02 10:33:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:07,414 INFO L93 Difference]: Finished difference Result 386 states and 448 transitions. [2018-02-02 10:33:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:33:07,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-02-02 10:33:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:07,415 INFO L225 Difference]: With dead ends: 386 [2018-02-02 10:33:07,415 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 10:33:07,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:33:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 10:33:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 353. [2018-02-02 10:33:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-02 10:33:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 414 transitions. [2018-02-02 10:33:07,417 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 414 transitions. Word has length 54 [2018-02-02 10:33:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:07,417 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 414 transitions. [2018-02-02 10:33:07,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 414 transitions. [2018-02-02 10:33:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:33:07,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:07,418 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] [2018-02-02 10:33:07,418 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:33:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1360372730, now seen corresponding path program 1 times [2018-02-02 10:33:07,418 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:07,424 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,618 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:33:07,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:07,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:33:07,619 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:07,619 INFO L134 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,619 INFO L182 omatonBuilderFactory]: Interpolants [22880#(= 1 (select |#valid| |main_#t~mem20.base|)), 22862#true, 22863#false, 22864#(= (select |#valid| main_~head~0.base) 1), 22865#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22866#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 22867#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22868#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 22869#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 22870#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 22871#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 22872#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22873#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22874#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 22875#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 22876#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22877#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 22878#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 22879#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:07,619 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:33:07,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:33:07,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:33:07,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:33:07,620 INFO L87 Difference]: Start difference. First operand 353 states and 414 transitions. Second operand 19 states. [2018-02-02 10:33:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:08,369 INFO L93 Difference]: Finished difference Result 442 states and 509 transitions. [2018-02-02 10:33:08,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:33:08,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 10:33:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:08,370 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:33:08,370 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:33:08,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=1165, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:33:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:33:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 361. [2018-02-02 10:33:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 10:33:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 424 transitions. [2018-02-02 10:33:08,373 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 424 transitions. Word has length 55 [2018-02-02 10:33:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:08,373 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 424 transitions. [2018-02-02 10:33:08,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:33:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 424 transitions. [2018-02-02 10:33:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:33:08,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:08,374 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] [2018-02-02 10:33:08,374 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:33:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1360372729, now seen corresponding path program 1 times [2018-02-02 10:33:08,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:08,380 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:08,647 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:33:08,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:08,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:33:08,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:08,647 INFO L182 omatonBuilderFactory]: Interpolants [23720#true, 23721#false, 23722#(= (select |#valid| main_~head~0.base) 1), 23723#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23724#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 23725#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23726#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 23727#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 23728#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 23729#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 23730#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 23731#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 23732#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 23733#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23734#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 23735#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 23736#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 23737#(and (= (select |#length| |main_#t~mem20.base|) 8) (= |main_#t~mem20.offset| 0))] [2018-02-02 10:33:08,648 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:33:08,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:33:08,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:33:08,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:33:08,648 INFO L87 Difference]: Start difference. First operand 361 states and 424 transitions. Second operand 18 states. [2018-02-02 10:33:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:09,470 INFO L93 Difference]: Finished difference Result 442 states and 509 transitions. [2018-02-02 10:33:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:33:09,470 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-02-02 10:33:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:09,471 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:33:09,471 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:33:09,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:33:09,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:33:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 359. [2018-02-02 10:33:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:33:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2018-02-02 10:33:09,474 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 55 [2018-02-02 10:33:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:09,474 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2018-02-02 10:33:09,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:33:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2018-02-02 10:33:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:33:09,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:09,475 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:09,475 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:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2064055094, now seen corresponding path program 2 times [2018-02-02 10:33:09,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:09,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:09,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:09,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:33:09,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:09,776 INFO L182 omatonBuilderFactory]: Interpolants [24576#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem20.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24577#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24578#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24579#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24580#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24581#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 24582#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 24583#(and (<= 0 main_~prev~0.offset) (<= main_~prev~0.offset 0) (= 8 (select |#length| main_~prev~0.base))), 24567#true, 24568#false, 24569#(= (select |#valid| main_~head~0.base) 1), 24570#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 24571#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 24572#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 24573#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24574#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 24575#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:33:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:09,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:33:09,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:33:09,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:33:09,777 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand 17 states. [2018-02-02 10:33:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:10,468 INFO L93 Difference]: Finished difference Result 442 states and 512 transitions. [2018-02-02 10:33:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:33:10,468 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:33:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:10,469 INFO L225 Difference]: With dead ends: 442 [2018-02-02 10:33:10,469 INFO L226 Difference]: Without dead ends: 442 [2018-02-02 10:33:10,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-02-02 10:33:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 344. [2018-02-02 10:33:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 10:33:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 406 transitions. [2018-02-02 10:33:10,472 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 406 transitions. Word has length 56 [2018-02-02 10:33:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:10,473 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 406 transitions. [2018-02-02 10:33:10,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:33:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 406 transitions. [2018-02-02 10:33:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:33:10,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:10,473 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] [2018-02-02 10:33:10,473 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:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1248898328, now seen corresponding path program 3 times [2018-02-02 10:33:10,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:10,481 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:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:10,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:10,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:33:10,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:10,639 INFO L134 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:10,640 INFO L182 omatonBuilderFactory]: Interpolants [25408#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 25409#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 25410#(not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25411#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25412#(and (not (= |main_#t~mem20.base| main_~head~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25413#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25414#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 25415#(= 1 (select |#valid| |main_#t~mem22.base|)), 25416#(= 1 (select |#valid| main_~next~0.base)), 25417#(= 1 (select |#valid| main_~x~0.base)), 25398#true, 25399#false, 25400#(= (select |#valid| main_~head~0.base) 1), 25401#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 25402#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 25403#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 25404#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1)), 25405#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 25406#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 25407#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 10:33:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:10,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:33:10,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:33:10,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:33:10,640 INFO L87 Difference]: Start difference. First operand 344 states and 406 transitions. Second operand 20 states. [2018-02-02 10:33:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:11,427 INFO L93 Difference]: Finished difference Result 440 states and 509 transitions. [2018-02-02 10:33:11,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:33:11,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-02-02 10:33:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:11,428 INFO L225 Difference]: With dead ends: 440 [2018-02-02 10:33:11,428 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 10:33:11,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:33:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 10:33:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 357. [2018-02-02 10:33:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 10:33:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 421 transitions. [2018-02-02 10:33:11,431 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 421 transitions. Word has length 56 [2018-02-02 10:33:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:11,431 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 421 transitions. [2018-02-02 10:33:11,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 421 transitions. [2018-02-02 10:33:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:33:11,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:11,431 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] [2018-02-02 10:33:11,432 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:11,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1248898327, now seen corresponding path program 2 times [2018-02-02 10:33:11,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:11,443 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,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:11,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:11,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:33:11,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:11,895 INFO L134 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,895 INFO L182 omatonBuilderFactory]: Interpolants [26272#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 26251#true, 26252#false, 26253#(= (select |#valid| main_~head~0.base) 1), 26254#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26255#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 26256#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26257#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26258#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 26259#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 26260#(and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 26261#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26262#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26263#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 26264#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26265#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26266#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem20.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26267#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26268#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26269#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26270#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26271#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base)))] [2018-02-02 10:33:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:11,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:11,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:11,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:11,896 INFO L87 Difference]: Start difference. First operand 357 states and 421 transitions. Second operand 22 states. [2018-02-02 10:33:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:12,892 INFO L93 Difference]: Finished difference Result 512 states and 592 transitions. [2018-02-02 10:33:12,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:33:12,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-02-02 10:33:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:12,893 INFO L225 Difference]: With dead ends: 512 [2018-02-02 10:33:12,893 INFO L226 Difference]: Without dead ends: 512 [2018-02-02 10:33:12,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:33:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-02 10:33:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 378. [2018-02-02 10:33:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-02 10:33:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 444 transitions. [2018-02-02 10:33:12,896 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 444 transitions. Word has length 56 [2018-02-02 10:33:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:12,896 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 444 transitions. [2018-02-02 10:33:12,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 444 transitions. [2018-02-02 10:33:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:33:12,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:12,897 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:12,897 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:12,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1733878596, now seen corresponding path program 1 times [2018-02-02 10:33:12,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:12,901 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:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:33:12,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:12,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:33:12,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:12,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:33:12,929 INFO L182 omatonBuilderFactory]: Interpolants [27193#true, 27194#false, 27195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) |main_#t~mem24|), 27196#(= main_~t1~0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 27197#(and (not (= main_~t1~0 2)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) main_~t1~0)), 27198#(not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 2)), 27199#(not (= |main_#t~mem27| 2))] [2018-02-02 10:33:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:33:12,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:33:12,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:33:12,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:33:12,929 INFO L87 Difference]: Start difference. First operand 378 states and 444 transitions. Second operand 7 states. [2018-02-02 10:33:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:13,029 INFO L93 Difference]: Finished difference Result 409 states and 476 transitions. [2018-02-02 10:33:13,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:33:13,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-02 10:33:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:13,030 INFO L225 Difference]: With dead ends: 409 [2018-02-02 10:33:13,030 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 10:33:13,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:33:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 10:33:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2018-02-02 10:33:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 10:33:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 466 transitions. [2018-02-02 10:33:13,033 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 466 transitions. Word has length 60 [2018-02-02 10:33:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:13,033 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 466 transitions. [2018-02-02 10:33:13,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:33:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 466 transitions. [2018-02-02 10:33:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:33:13,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:13,033 INFO L351 BasicCegarLoop]: trace histogram [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:13,033 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:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2075785459, now seen corresponding path program 1 times [2018-02-02 10:33:13,034 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:13,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:33:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:13,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:13,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:33:13,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:13,184 INFO L134 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,184 INFO L182 omatonBuilderFactory]: Interpolants [28009#true, 28010#false, 28011#(= (select |#valid| main_~head~0.base) 1), 28012#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28013#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28014#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28015#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1)), 28016#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 28017#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1)), 28018#(and (not (= main_~head~0.base |main_#t~mem12.base|)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 28019#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 28020#(and (not (= main_~head~0.base |main_#t~malloc15.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc15.base|)) main_~head~0.base) main_~head~0.offset))), 28021#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 28022#(and (not (= main_~head~0.base |main_#t~mem17.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 28023#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 28024#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 28025#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 28026#(= 1 (select |#valid| |main_#t~mem22.base|)), 28027#(= 1 (select |#valid| main_~next~0.base)), 28028#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:13,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:33:13,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:33:13,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:33:13,185 INFO L87 Difference]: Start difference. First operand 398 states and 466 transitions. Second operand 20 states. [2018-02-02 10:33:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:13,893 INFO L93 Difference]: Finished difference Result 502 states and 578 transitions. [2018-02-02 10:33:13,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:33:13,894 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-02 10:33:13,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:13,895 INFO L225 Difference]: With dead ends: 502 [2018-02-02 10:33:13,895 INFO L226 Difference]: Without dead ends: 502 [2018-02-02 10:33:13,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:33:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-02-02 10:33:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 411. [2018-02-02 10:33:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:33:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 479 transitions. [2018-02-02 10:33:13,898 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 479 transitions. Word has length 60 [2018-02-02 10:33:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:13,898 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 479 transitions. [2018-02-02 10:33:13,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:33:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 479 transitions. [2018-02-02 10:33:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:33:13,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:13,898 INFO L351 BasicCegarLoop]: trace histogram [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:13,898 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:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2075785458, now seen corresponding path program 1 times [2018-02-02 10:33:13,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:13,905 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,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:14,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:14,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:14,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:14,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:33:14,200 INFO L182 omatonBuilderFactory]: Interpolants [28992#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28993#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem17.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28994#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 28995#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28996#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28997#(and (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28998#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| main_~next~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28999#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 29000#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset)), 28978#true, 28979#false, 28980#(= (select |#valid| main_~head~0.base) 1), 28981#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28982#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 28983#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28984#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28985#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 28986#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28987#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28988#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28989#(and (not (= main_~head~0.base |main_#t~mem12.base|)) (= (select |#valid| |main_#t~mem12.base|) 1) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| |main_#t~mem12.base|))), 28990#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 28991#(and (not (= main_~head~0.base |main_#t~malloc15.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc15.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc15.base|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)))] [2018-02-02 10:33:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:14,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:14,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:14,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:14,201 INFO L87 Difference]: Start difference. First operand 411 states and 479 transitions. Second operand 23 states. [2018-02-02 10:33:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:14,968 INFO L93 Difference]: Finished difference Result 509 states and 588 transitions. [2018-02-02 10:33:14,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:33:14,968 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 10:33:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:14,969 INFO L225 Difference]: With dead ends: 509 [2018-02-02 10:33:14,969 INFO L226 Difference]: Without dead ends: 509 [2018-02-02 10:33:14,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:33:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-02-02 10:33:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 411. [2018-02-02 10:33:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 10:33:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 479 transitions. [2018-02-02 10:33:14,972 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 479 transitions. Word has length 60 [2018-02-02 10:33:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:14,972 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 479 transitions. [2018-02-02 10:33:14,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 479 transitions. [2018-02-02 10:33:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:14,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:14,973 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 10:33:14,973 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:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash 368380609, now seen corresponding path program 1 times [2018-02-02 10:33:14,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:14,980 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:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:15,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:15,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:33:15,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:15,021 INFO L182 omatonBuilderFactory]: Interpolants [29952#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 29953#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 29954#(= 1 (select |#valid| |main_#t~mem29.base|)), 29945#true, 29946#false, 29947#(= main_~x~0.base main_~head~0.base), 29948#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 29949#(= 1 (select |#valid| main_~head~0.base)), 29950#(= 1 (select |#valid| main_~x~0.base)), 29951#(= 1 (select |#valid| main_~prev~0.base))] [2018-02-02 10:33:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:15,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:33:15,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:33:15,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:15,022 INFO L87 Difference]: Start difference. First operand 411 states and 479 transitions. Second operand 10 states. [2018-02-02 10:33:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:15,265 INFO L93 Difference]: Finished difference Result 472 states and 521 transitions. [2018-02-02 10:33:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:33:15,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-02-02 10:33:15,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:15,266 INFO L225 Difference]: With dead ends: 472 [2018-02-02 10:33:15,266 INFO L226 Difference]: Without dead ends: 472 [2018-02-02 10:33:15,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:33:15,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-02-02 10:33:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 427. [2018-02-02 10:33:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-02-02 10:33:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 501 transitions. [2018-02-02 10:33:15,269 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 501 transitions. Word has length 62 [2018-02-02 10:33:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:15,269 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 501 transitions. [2018-02-02 10:33:15,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:33:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 501 transitions. [2018-02-02 10:33:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:15,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:15,270 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 10:33:15,270 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:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash 368380610, now seen corresponding path program 1 times [2018-02-02 10:33:15,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:15,290 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:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:15,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:15,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:33:15,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:15,431 INFO L134 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:15,432 INFO L182 omatonBuilderFactory]: Interpolants [30880#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 30881#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 30882#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 30883#(and (= 0 main_~head~0.offset) (not (= |main_#t~malloc15.base| main_~x~0.base)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 30884#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 30885#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 30886#(and (= 0 main_~prev~0.offset) (<= 8 (select |#length| main_~prev~0.base))), 30887#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 30888#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset))), 30889#(and (= 0 main_~t2~0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 30890#(and (<= 8 (select |#length| |main_#t~mem29.base|)) (= 0 |main_#t~mem29.offset|)), 30891#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 30877#true, 30878#false, 30879#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-02 10:33:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:15,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:33:15,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:33:15,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:33:15,432 INFO L87 Difference]: Start difference. First operand 427 states and 501 transitions. Second operand 15 states. [2018-02-02 10:33:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:15,951 INFO L93 Difference]: Finished difference Result 564 states and 633 transitions. [2018-02-02 10:33:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:33:15,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 10:33:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:15,953 INFO L225 Difference]: With dead ends: 564 [2018-02-02 10:33:15,953 INFO L226 Difference]: Without dead ends: 564 [2018-02-02 10:33:15,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-02-02 10:33:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 459. [2018-02-02 10:33:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-02-02 10:33:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 542 transitions. [2018-02-02 10:33:15,956 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 542 transitions. Word has length 62 [2018-02-02 10:33:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:15,956 INFO L432 AbstractCegarLoop]: Abstraction has 459 states and 542 transitions. [2018-02-02 10:33:15,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:33:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 542 transitions. [2018-02-02 10:33:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:15,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:15,957 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] [2018-02-02 10:33:15,957 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:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1941046340, now seen corresponding path program 4 times [2018-02-02 10:33:15,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:15,968 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,493 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:16,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:16,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:33:16,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:16,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:16,494 INFO L182 omatonBuilderFactory]: Interpolants [31947#true, 31948#false, 31949#(= 0 |main_#t~malloc0.offset|), 31950#(= 0 main_~head~0.offset), 31951#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 31952#(and (= 0 main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 31953#(and (= |main_#t~malloc4.offset| main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 31954#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 31955#(and (= |main_#t~mem6.offset| main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 31956#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 31957#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 31958#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 31959#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31960#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31961#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 31962#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 31963#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31964#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 31965#(and (not (= |main_#t~mem20.base| main_~head~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (+ |main_#t~mem20.offset| 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31966#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 31967#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 31968#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem22.base|) |main_#t~mem22.offset|))), 31969#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset))), 31970#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset))), 31971#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31972#(= 1 (select |#valid| |main_#t~mem22.base|)), 31973#(= 1 (select |#valid| main_~next~0.base)), 31974#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:16,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:33:16,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:33:16,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:33:16,494 INFO L87 Difference]: Start difference. First operand 459 states and 542 transitions. Second operand 28 states. [2018-02-02 10:33:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:18,157 INFO L93 Difference]: Finished difference Result 703 states and 813 transitions. [2018-02-02 10:33:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:33:18,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-02-02 10:33:18,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:18,159 INFO L225 Difference]: With dead ends: 703 [2018-02-02 10:33:18,159 INFO L226 Difference]: Without dead ends: 703 [2018-02-02 10:33:18,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=639, Invalid=3651, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:33:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-02-02 10:33:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 475. [2018-02-02 10:33:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-02-02 10:33:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 561 transitions. [2018-02-02 10:33:18,164 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 561 transitions. Word has length 62 [2018-02-02 10:33:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:18,164 INFO L432 AbstractCegarLoop]: Abstraction has 475 states and 561 transitions. [2018-02-02 10:33:18,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:33:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 561 transitions. [2018-02-02 10:33:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:18,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:18,165 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] [2018-02-02 10:33:18,165 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:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1941046339, now seen corresponding path program 3 times [2018-02-02 10:33:18,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:18,174 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:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:18,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:18,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:33:18,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:18,742 INFO L134 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:18,742 INFO L182 omatonBuilderFactory]: Interpolants [33229#true, 33230#false, 33231#(= (select |#valid| main_~head~0.base) 1), 33232#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 33233#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 33234#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 33235#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 33236#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 33237#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 33238#(and (not (= main_~head~0.base main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 33239#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 33240#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 33241#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 33242#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 33243#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 33244#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem20.base| main_~head~0.base)) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (+ |main_#t~mem20.offset| 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 33245#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 33246#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 33247#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem22.base|) |main_#t~mem22.offset|)))), 33248#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) main_~next~0.base) main_~next~0.offset))), 33249#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~next~0.base) main_~next~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset)))), 33250#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 33251#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 33252#(and (= 0 main_~next~0.offset) (= 8 (select |#length| main_~next~0.base))), 33253#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 10:33:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:18,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:33:18,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:33:18,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:33:18,743 INFO L87 Difference]: Start difference. First operand 475 states and 561 transitions. Second operand 25 states. [2018-02-02 10:33:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:20,538 INFO L93 Difference]: Finished difference Result 713 states and 833 transitions. [2018-02-02 10:33:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:33:20,538 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 10:33:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:20,540 INFO L225 Difference]: With dead ends: 713 [2018-02-02 10:33:20,540 INFO L226 Difference]: Without dead ends: 713 [2018-02-02 10:33:20,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:33:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-02-02 10:33:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 477. [2018-02-02 10:33:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-02-02 10:33:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 562 transitions. [2018-02-02 10:33:20,544 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 562 transitions. Word has length 62 [2018-02-02 10:33:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:20,544 INFO L432 AbstractCegarLoop]: Abstraction has 477 states and 562 transitions. [2018-02-02 10:33:20,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:33:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 562 transitions. [2018-02-02 10:33:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:20,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,545 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,545 INFO L371 AbstractCegarLoop]: === Iteration 53 === [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:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash -832443681, now seen corresponding path program 1 times [2018-02-02 10:33:20,545 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,552 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:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:20,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:33:20,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:20,606 INFO L134 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:20,606 INFO L182 omatonBuilderFactory]: Interpolants [34484#true, 34485#false, 34486#(= main_~x~0.base main_~head~0.base), 34487#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 34488#(= 1 (select |#valid| main_~head~0.base)), 34489#(= 1 (select |#valid| main_~x~0.base)), 34490#(= 1 (select |#valid| main_~prev~0.base)), 34491#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34492#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 34493#(= 1 (select |#valid| |main_#t~mem28.base|))] [2018-02-02 10:33:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:33:20,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:33:20,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:20,606 INFO L87 Difference]: Start difference. First operand 477 states and 562 transitions. Second operand 10 states. [2018-02-02 10:33:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:20,860 INFO L93 Difference]: Finished difference Result 521 states and 583 transitions. [2018-02-02 10:33:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:33:20,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:33:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:20,861 INFO L225 Difference]: With dead ends: 521 [2018-02-02 10:33:20,861 INFO L226 Difference]: Without dead ends: 521 [2018-02-02 10:33:20,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:33:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-02 10:33:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 480. [2018-02-02 10:33:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-02-02 10:33:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 566 transitions. [2018-02-02 10:33:20,864 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 566 transitions. Word has length 63 [2018-02-02 10:33:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:20,864 INFO L432 AbstractCegarLoop]: Abstraction has 480 states and 566 transitions. [2018-02-02 10:33:20,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:33:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 566 transitions. [2018-02-02 10:33:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:20,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,864 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,865 INFO L371 AbstractCegarLoop]: === Iteration 54 === [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:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -832443680, now seen corresponding path program 1 times [2018-02-02 10:33:20,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,870 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:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:21,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:33:21,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:21,009 INFO L134 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:21,009 INFO L182 omatonBuilderFactory]: Interpolants [35520#(= 0 |main_#t~malloc0.offset|), 35521#(= 0 main_~head~0.offset), 35522#(= 0 main_~x~0.offset), 35523#(= 0 main_~prev~0.offset), 35524#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 35525#(= 0 (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset)), 35526#(and (= |main_#t~mem25.offset| 0) (<= (select |#length| |main_#t~mem25.base|) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35527#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 35528#(and (= 0 |main_#t~mem28.offset|) (<= 8 (select |#length| |main_#t~mem28.base|))), 35529#(and (= main_~x~0.offset 0) (<= 8 (select |#length| main_~x~0.base))), 35518#true, 35519#false] [2018-02-02 10:33:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:33:21,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:33:21,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:33:21,009 INFO L87 Difference]: Start difference. First operand 480 states and 566 transitions. Second operand 12 states. [2018-02-02 10:33:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:21,490 INFO L93 Difference]: Finished difference Result 592 states and 664 transitions. [2018-02-02 10:33:21,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:33:21,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:33:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:21,492 INFO L225 Difference]: With dead ends: 592 [2018-02-02 10:33:21,492 INFO L226 Difference]: Without dead ends: 592 [2018-02-02 10:33:21,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=1152, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:33:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-02-02 10:33:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 484. [2018-02-02 10:33:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-02-02 10:33:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 572 transitions. [2018-02-02 10:33:21,495 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 572 transitions. Word has length 63 [2018-02-02 10:33:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:21,496 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 572 transitions. [2018-02-02 10:33:21,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:33:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 572 transitions. [2018-02-02 10:33:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:21,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:21,496 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:21,496 INFO L371 AbstractCegarLoop]: === Iteration 55 === [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:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash -465235373, now seen corresponding path program 2 times [2018-02-02 10:33:21,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:21,508 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:21,923 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:21,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:21,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:33:21,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:21,923 INFO L134 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:21,923 INFO L182 omatonBuilderFactory]: Interpolants [36672#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36673#(or (and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36674#(or (and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36675#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36676#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| 0))), 36677#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem14.offset| 0) (= main_~x~0.base main_~head~0.base) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36678#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0)) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| 0))), 36679#(or (and (not (= |main_#t~mem20.base| main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (= 1 (select |#valid| 0))), 36680#(or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (= 1 (select |#valid| 0))), 36681#(and (= 0 main_~prev~0.base) (or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= 1 (select |#valid| 0)))), 36682#(and (= 0 main_~prev~0.base) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| 0)))), 36683#(and (= 0 main_~prev~0.base) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= main_~next~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| 0)))), 36684#(and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (or (= 1 (select |#valid| 0)) (not (= main_~next~0.base 0)))), 36685#(and (or (not (= main_~x~0.base 0)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 36686#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 36687#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 36688#(= (select |#valid| |main_#t~mem25.base|) 1), 36662#true, 36663#false, 36664#(= 0 (select |#valid| 0)), 36665#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0))), 36666#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base)), 36667#(or (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)) (= 1 (select |#valid| 0))), 36668#(or (= 1 (select |#valid| 0)) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))), 36669#(or (and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36670#(or (and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 36671#(or (and (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))) (= 1 (select |#valid| 0)))] [2018-02-02 10:33:21,923 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:21,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:33:21,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:33:21,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:33:21,924 INFO L87 Difference]: Start difference. First operand 484 states and 572 transitions. Second operand 27 states. [2018-02-02 10:33:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:22,913 INFO L93 Difference]: Finished difference Result 505 states and 590 transitions. [2018-02-02 10:33:22,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:33:22,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 10:33:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:22,914 INFO L225 Difference]: With dead ends: 505 [2018-02-02 10:33:22,914 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 10:33:22,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:33:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 10:33:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 484. [2018-02-02 10:33:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-02-02 10:33:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 570 transitions. [2018-02-02 10:33:22,917 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 570 transitions. Word has length 63 [2018-02-02 10:33:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:22,917 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 570 transitions. [2018-02-02 10:33:22,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:33:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 570 transitions. [2018-02-02 10:33:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:22,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:22,918 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2018-02-02 10:33:22,918 INFO L371 AbstractCegarLoop]: === Iteration 56 === [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:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1192189465, now seen corresponding path program 6 times [2018-02-02 10:33:22,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:22,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:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:23,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:23,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:23,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:23,364 INFO L134 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:23,364 INFO L182 omatonBuilderFactory]: Interpolants [37728#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 37729#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 37730#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 37731#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 37732#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 37733#(= 1 (select |#valid| |main_#t~mem12.base|)), 37734#(= 1 (select |#valid| main_~x~0.base)), 37712#true, 37713#false, 37714#(= (select |#valid| main_~head~0.base) 1), 37715#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 37716#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 37717#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 37718#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 37719#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 37720#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 37721#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|))), 37722#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 37723#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 37724#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 37725#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 37726#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 37727#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))] [2018-02-02 10:33:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:23,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:23,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:23,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:23,364 INFO L87 Difference]: Start difference. First operand 484 states and 570 transitions. Second operand 23 states. [2018-02-02 10:33:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:24,509 INFO L93 Difference]: Finished difference Result 620 states and 717 transitions. [2018-02-02 10:33:24,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:33:24,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:33:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:24,511 INFO L225 Difference]: With dead ends: 620 [2018-02-02 10:33:24,511 INFO L226 Difference]: Without dead ends: 620 [2018-02-02 10:33:24,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:33:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-02-02 10:33:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 516. [2018-02-02 10:33:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-02-02 10:33:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 608 transitions. [2018-02-02 10:33:24,517 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 608 transitions. Word has length 63 [2018-02-02 10:33:24,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:24,517 INFO L432 AbstractCegarLoop]: Abstraction has 516 states and 608 transitions. [2018-02-02 10:33:24,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 608 transitions. [2018-02-02 10:33:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:24,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:24,518 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2018-02-02 10:33:24,518 INFO L371 AbstractCegarLoop]: === Iteration 57 === [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:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1192189464, now seen corresponding path program 5 times [2018-02-02 10:33:24,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:24,528 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:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:25,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:25,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:25,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:25,044 INFO L182 omatonBuilderFactory]: Interpolants [38944#(and (= 0 |main_#t~mem12.offset|) (<= 4 (select |#length| |main_#t~mem12.base|))), 38945#(and (<= 4 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 38923#true, 38924#false, 38925#(= (select |#valid| main_~head~0.base) 1), 38926#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 38927#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 38928#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 38929#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 38930#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 38931#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 38932#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 38933#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 38934#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 |main_#t~mem6.offset|)), 38935#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 38936#(and (or (< 3 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)) (or (and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))) (<= (select |#length| main_~x~0.base) 3))), 38937#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (< 3 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 38938#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 38939#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 38940#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 38941#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 38942#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 38943#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:25,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:25,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:25,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:25,045 INFO L87 Difference]: Start difference. First operand 516 states and 608 transitions. Second operand 23 states. [2018-02-02 10:33:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:26,650 INFO L93 Difference]: Finished difference Result 656 states and 758 transitions. [2018-02-02 10:33:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:33:26,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 10:33:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:26,651 INFO L225 Difference]: With dead ends: 656 [2018-02-02 10:33:26,651 INFO L226 Difference]: Without dead ends: 656 [2018-02-02 10:33:26,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:33:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-02-02 10:33:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 528. [2018-02-02 10:33:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-02-02 10:33:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 623 transitions. [2018-02-02 10:33:26,654 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 623 transitions. Word has length 63 [2018-02-02 10:33:26,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:26,655 INFO L432 AbstractCegarLoop]: Abstraction has 528 states and 623 transitions. [2018-02-02 10:33:26,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 623 transitions. [2018-02-02 10:33:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:33:26,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:26,655 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:26,655 INFO L371 AbstractCegarLoop]: === Iteration 58 === [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:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1566095437, now seen corresponding path program 7 times [2018-02-02 10:33:26,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:26,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:33:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:26,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:26,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:26,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:26,951 INFO L134 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:26,951 INFO L182 omatonBuilderFactory]: Interpolants [40192#(and (= 0 |main_#t~mem9.base|) (= |main_#t~mem9.offset| 0)), 40193#(not |main_#t~short11|), 40172#true, 40173#false, 40174#(= (select |#valid| main_~head~0.base) 1), 40175#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 40176#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 40177#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 40178#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 40179#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 40180#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 40181#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 40182#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 40183#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 40184#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 40185#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 40186#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 40187#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 40188#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 40189#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 40190#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))), 40191#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:26,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:26,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:26,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:26,952 INFO L87 Difference]: Start difference. First operand 528 states and 623 transitions. Second operand 22 states. [2018-02-02 10:33:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:28,096 INFO L93 Difference]: Finished difference Result 567 states and 662 transitions. [2018-02-02 10:33:28,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:33:28,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-02-02 10:33:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:28,097 INFO L225 Difference]: With dead ends: 567 [2018-02-02 10:33:28,097 INFO L226 Difference]: Without dead ends: 567 [2018-02-02 10:33:28,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:33:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-02-02 10:33:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 537. [2018-02-02 10:33:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-02 10:33:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 632 transitions. [2018-02-02 10:33:28,100 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 632 transitions. Word has length 64 [2018-02-02 10:33:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:28,101 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 632 transitions. [2018-02-02 10:33:28,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 632 transitions. [2018-02-02 10:33:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:33:28,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:28,101 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:28,101 INFO L371 AbstractCegarLoop]: === Iteration 59 === [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:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash 429862338, now seen corresponding path program 2 times [2018-02-02 10:33:28,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:28,110 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:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:28,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:28,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:33:28,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:28,691 INFO L134 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:28,691 INFO L182 omatonBuilderFactory]: Interpolants [41350#true, 41351#false, 41352#(= |main_#t~malloc0.offset| 0), 41353#(= main_~head~0.offset 0), 41354#(and (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 41355#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41356#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|)), 41357#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 41358#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 41359#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41360#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 41361#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= main_~head~0.offset 0)), 41362#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 41363#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41364#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41365#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 41366#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41367#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 41368#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41369#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 41370#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 41371#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem9.offset| 0)), 41372#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not |main_#t~short11|)), 41373#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 41374#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (not (= 0 |main_#t~mem12.base|))), 41375#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 41376#(= 1 (select |#valid| |main_#t~mem20.base|))] [2018-02-02 10:33:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:28,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:33:28,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:33:28,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:33:28,691 INFO L87 Difference]: Start difference. First operand 537 states and 632 transitions. Second operand 27 states. [2018-02-02 10:33:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:30,759 INFO L93 Difference]: Finished difference Result 635 states and 734 transitions. [2018-02-02 10:33:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:33:30,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 10:33:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:30,761 INFO L225 Difference]: With dead ends: 635 [2018-02-02 10:33:30,761 INFO L226 Difference]: Without dead ends: 635 [2018-02-02 10:33:30,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=760, Invalid=4352, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:33:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-02-02 10:33:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 545. [2018-02-02 10:33:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-02-02 10:33:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 642 transitions. [2018-02-02 10:33:30,765 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 642 transitions. Word has length 64 [2018-02-02 10:33:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:30,765 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 642 transitions. [2018-02-02 10:33:30,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:33:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 642 transitions. [2018-02-02 10:33:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:33:30,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:30,765 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:30,765 INFO L371 AbstractCegarLoop]: === Iteration 60 === [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:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash 429862339, now seen corresponding path program 2 times [2018-02-02 10:33:30,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:30,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:31,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:31,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:31,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:31,148 INFO L134 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:31,148 INFO L182 omatonBuilderFactory]: Interpolants [42656#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 42657#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 42658#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|))), 42659#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 42660#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 42661#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 42662#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 42663#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 42664#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 42665#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 42666#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 42667#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 42668#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 42669#(and (= (select |#length| |main_#t~mem20.base|) 8) (= |main_#t~mem20.offset| 0)), 42647#true, 42648#false, 42649#(= (select |#valid| main_~head~0.base) 1), 42650#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 42651#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 42652#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 42653#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 42654#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 42655#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:33:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:31,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:31,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:31,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:31,149 INFO L87 Difference]: Start difference. First operand 545 states and 642 transitions. Second operand 23 states. Received shutdown request... [2018-02-02 10:33:31,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:33:31,291 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:33:31,296 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:33:31,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:33:31 BoogieIcfgContainer [2018-02-02 10:33:31,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:33:31,296 INFO L168 Benchmark]: Toolchain (without parser) took 51884.90 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 869.8 MB). Free memory was 356.4 MB in the beginning and 696.9 MB in the end (delta: -340.6 MB). Peak memory consumption was 529.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:31,297 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:33:31,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.89 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:31,297 INFO L168 Benchmark]: Boogie Preprocessor took 27.37 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 341.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:31,298 INFO L168 Benchmark]: RCFGBuilder took 418.50 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 305.2 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:31,298 INFO L168 Benchmark]: TraceAbstraction took 51268.44 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 869.8 MB). Free memory was 305.2 MB in the beginning and 696.9 MB in the end (delta: -391.8 MB). Peak memory consumption was 478.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:33:31,299 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.12 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.89 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.37 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 341.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 418.50 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 305.2 MB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51268.44 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 869.8 MB). Free memory was 305.2 MB in the beginning and 696.9 MB in the end (delta: -391.8 MB). Peak memory consumption was 478.0 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 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 981). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (545states) and interpolant automaton (currently 9 states, 23 states before enhancement), while ReachableStatesComputation was computing reachable states (24 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 134 locations, 53 error locations. TIMEOUT Result, 51.2s OverallTime, 60 OverallIterations, 4 TraceHistogramMax, 37.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5796 SDtfs, 20489 SDslu, 37849 SDs, 0 SdLazy, 54773 SolverSat, 3671 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1809 GetRequests, 138 SyntacticMatches, 95 SemanticMatches, 1576 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11447 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=545occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 57/875 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 59 MinimizatonAttempts, 4103 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2812 NumberOfCodeBlocks, 2812 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 2355226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 13 PerfectInterpolantSequences, 57/875 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-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-33-31-304.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-33-31-304.csv Completed graceful shutdown