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/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:00:41,178 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:00:41,179 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:00:41,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:00:41,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:00:41,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:00:41,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:00:41,195 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:00:41,197 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:00:41,197 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:00:41,198 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:00:41,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:00:41,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:00:41,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:00:41,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:00:41,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:00:41,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:00:41,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:00:41,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:00:41,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:00:41,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:00:41,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:00:41,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:00:41,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:00:41,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:00:41,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:00:41,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:00:41,212 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:00:41,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:00:41,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:00:41,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:00:41,213 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:00:41,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:00:41,222 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:00:41,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:00:41,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:00:41,223 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:00:41,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:00:41,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:00:41,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:00:41,225 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:00:41,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:00:41,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:00:41,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:00:41,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:00:41,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:00:41,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:00:41,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:00:41,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:00:41,265 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:00:41,268 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:00:41,269 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:00:41,269 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:00:41,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_dsw_true-valid-memsafety_false-termination.i [2018-02-02 10:00:41,407 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:00:41,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:00:41,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:00:41,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:00:41,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:00:41,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372861f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41, skipping insertion in model container [2018-02-02 10:00:41,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,426 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:00:41,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:00:41,551 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:00:41,568 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:00:41,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41 WrapperNode [2018-02-02 10:00:41,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:00:41,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:00:41,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:00:41,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:00:41,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,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:00:41" (1/1) ... [2018-02-02 10:00:41,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (1/1) ... [2018-02-02 10:00:41,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:00:41,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:00:41,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:00:41,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:00:41,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (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:00:41,646 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:00:41,646 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:00:41,646 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:00:41,646 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:00:41,646 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:00:41,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:00:42,073 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:00:42,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:00:42 BoogieIcfgContainer [2018-02-02 10:00:42,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:00:42,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:00:42,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:00:42,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:00:42,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:00:41" (1/3) ... [2018-02-02 10:00:42,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bb81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:00:42, skipping insertion in model container [2018-02-02 10:00:42,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:00:41" (2/3) ... [2018-02-02 10:00:42,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bb81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:00:42, skipping insertion in model container [2018-02-02 10:00:42,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:00:42" (3/3) ... [2018-02-02 10:00:42,080 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-02-02 10:00:42,087 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:00:42,093 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-02 10:00:42,120 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:00:42,120 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:00:42,120 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:00:42,121 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:00:42,121 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:00:42,121 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:00:42,121 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:00:42,121 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:00:42,121 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:00:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-02-02 10:00:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:00:42,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:42,142 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:42,142 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash -985735074, now seen corresponding path program 1 times [2018-02-02 10:00:42,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:42,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:42,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:42,262 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,263 INFO L182 omatonBuilderFactory]: Interpolants [176#true, 177#false, 178#(= 1 (select |#valid| |main_#t~malloc0.base|)), 179#(= 1 (select |#valid| main_~root~0.base))] [2018-02-02 10:00:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:42,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:42,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:42,277 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 4 states. [2018-02-02 10:00:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:42,519 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 10:00:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:42,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:00:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:42,528 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:00:42,528 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:00:42,530 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:00:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:00:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-02-02 10:00:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:00:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-02-02 10:00:42,561 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 8 [2018-02-02 10:00:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:42,562 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-02-02 10:00:42,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-02-02 10:00:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:00:42,562 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:42,562 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:42,562 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash -985735073, now seen corresponding path program 1 times [2018-02-02 10:00:42,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:42,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:42,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:42,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,629 INFO L182 omatonBuilderFactory]: Interpolants [536#true, 537#false, 538#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 539#(and (= (select |#length| main_~root~0.base) 8) (= main_~root~0.offset 0))] [2018-02-02 10:00:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:42,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:42,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:42,630 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 4 states. [2018-02-02 10:00:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:42,732 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2018-02-02 10:00:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:42,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:00:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:42,734 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:00:42,734 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:00:42,735 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:00:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:00:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:00:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:00:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 10:00:42,748 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 8 [2018-02-02 10:00:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:42,748 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 10:00:42,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 10:00:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:00:42,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:42,749 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:42,749 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash 473226571, now seen corresponding path program 1 times [2018-02-02 10:00:42,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:42,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:42,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:42,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,802 INFO L182 omatonBuilderFactory]: Interpolants [874#true, 875#false, 876#(= 1 (select |#valid| main_~root~0.base)), 877#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:42,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:42,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:42,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:42,803 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-02-02 10:00:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:42,943 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 10:00:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:00:42,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 10:00:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:42,944 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:00:42,945 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:00:42,945 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:00:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:00:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2018-02-02 10:00:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:00:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-02-02 10:00:42,955 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 14 [2018-02-02 10:00:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:42,955 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-02-02 10:00:42,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-02-02 10:00:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:00:42,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:42,956 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:42,956 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:42,956 INFO L82 PathProgramCache]: Analyzing trace with hash 473226572, now seen corresponding path program 1 times [2018-02-02 10:00:42,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:42,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:43,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,018 INFO L182 omatonBuilderFactory]: Interpolants [1216#(and (= 0 main_~root~0.offset) (= 8 (select |#length| main_~root~0.base))), 1217#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 1213#true, 1214#false, 1215#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-02 10:00:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:43,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:43,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:43,018 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 5 states. [2018-02-02 10:00:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,180 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2018-02-02 10:00:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:00:43,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:00:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,183 INFO L225 Difference]: With dead ends: 211 [2018-02-02 10:00:43,183 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 10:00:43,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:00:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 10:00:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2018-02-02 10:00:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:00:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-02-02 10:00:43,192 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 14 [2018-02-02 10:00:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,192 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-02-02 10:00:43,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-02-02 10:00:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:00:43,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,193 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:00:43,193 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1727604301, now seen corresponding path program 1 times [2018-02-02 10:00:43,193 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:00:43,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,252 INFO L182 omatonBuilderFactory]: Interpolants [1621#true, 1622#false, 1623#(= |main_#t~malloc0.offset| 0), 1624#(= main_~root~0.offset 0), 1625#(= main_~root~0.offset |main_~#sentinel~0.offset|), 1626#(and (= main_~pred~0.base |main_~#sentinel~0.base|) (= main_~pred~0.offset main_~root~0.offset) (= main_~root~0.base main_~n~0.base)), 1627#(and (= main_~pred~0.offset main_~root~0.offset) (= main_~root~0.base main_~pred~0.base))] [2018-02-02 10:00:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:00:43,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:00:43,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:00:43,252 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 7 states. [2018-02-02 10:00:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,372 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2018-02-02 10:00:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:00:43,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 10:00:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,373 INFO L225 Difference]: With dead ends: 249 [2018-02-02 10:00:43,374 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 10:00:43,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 10:00:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2018-02-02 10:00:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:00:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-02-02 10:00:43,380 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 18 [2018-02-02 10:00:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,380 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-02-02 10:00:43,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:00:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-02-02 10:00:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:00:43,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,381 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] [2018-02-02 10:00:43,381 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 471570443, now seen corresponding path program 1 times [2018-02-02 10:00:43,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:00:43,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,418 INFO L182 omatonBuilderFactory]: Interpolants [2080#(= (select |#valid| main_~root~0.base) 1), 2081#(not (= main_~root~0.base |main_~#sentinel~0.base|)), 2082#(not (= main_~n~0.base |main_~#sentinel~0.base|)), 2078#true, 2079#false] [2018-02-02 10:00:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:43,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:43,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:43,418 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 5 states. [2018-02-02 10:00:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,527 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2018-02-02 10:00:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:43,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 10:00:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,528 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:00:43,528 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:00:43,529 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:00:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:00:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-02-02 10:00:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:00:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2018-02-02 10:00:43,534 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 21 [2018-02-02 10:00:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,534 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2018-02-02 10:00:43,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-02-02 10:00:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:00:43,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,535 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] [2018-02-02 10:00:43,535 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1608607228, now seen corresponding path program 1 times [2018-02-02 10:00:43,535 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,557 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:00:43,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:43,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,558 INFO L182 omatonBuilderFactory]: Interpolants [2482#true, 2483#false, 2484#(not |main_#t~short6|)] [2018-02-02 10:00:43,558 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:00:43,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:00:43,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:00:43,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:43,558 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 3 states. [2018-02-02 10:00:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,564 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-02 10:00:43,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:00:43,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 10:00:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,566 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:00:43,566 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:00:43,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:00:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:00:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-02-02 10:00:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 10:00:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2018-02-02 10:00:43,570 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 22 [2018-02-02 10:00:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,571 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2018-02-02 10:00:43,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:00:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2018-02-02 10:00:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:00:43,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,572 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] [2018-02-02 10:00:43,572 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1343010439, now seen corresponding path program 1 times [2018-02-02 10:00:43,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,669 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:00:43,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:00:43,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,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:00:43,670 INFO L182 omatonBuilderFactory]: Interpolants [2865#true, 2866#false, 2867#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 2868#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 2869#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 2870#(not |main_#t~short6|)] [2018-02-02 10:00:43,671 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:00:43,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:00:43,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:00:43,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:00:43,671 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 6 states. [2018-02-02 10:00:43,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:43,816 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2018-02-02 10:00:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:00:43,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:00:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:43,817 INFO L225 Difference]: With dead ends: 238 [2018-02-02 10:00:43,817 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 10:00:43,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 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:00:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 10:00:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2018-02-02 10:00:43,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:00:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2018-02-02 10:00:43,821 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 24 [2018-02-02 10:00:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:43,821 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2018-02-02 10:00:43,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:00:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2018-02-02 10:00:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:00:43,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:43,821 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] [2018-02-02 10:00:43,822 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174280, now seen corresponding path program 1 times [2018-02-02 10:00:43,822 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:43,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:43,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:43,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,853 INFO L182 omatonBuilderFactory]: Interpolants [3321#true, 3322#false, 3323#(= 1 (select |#valid| |main_#t~malloc13.base|)), 3324#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 3325#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:00:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:43,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:43,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:43,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:43,854 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand 5 states. [2018-02-02 10:00:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:44,069 INFO L93 Difference]: Finished difference Result 331 states and 382 transitions. [2018-02-02 10:00:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:44,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:00:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:44,070 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:00:44,071 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:00:44,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:00:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-02-02 10:00:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:00:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-02-02 10:00:44,076 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 25 [2018-02-02 10:00:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:44,077 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-02-02 10:00:44,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-02-02 10:00:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:00:44,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:44,077 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] [2018-02-02 10:00:44,078 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174281, now seen corresponding path program 1 times [2018-02-02 10:00:44,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:44,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:44,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:44,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,157 INFO L182 omatonBuilderFactory]: Interpolants [3872#(and (= (select |#length| |main_#t~mem15.base|) 8) (= |main_#t~mem15.offset| 0)), 3868#true, 3869#false, 3870#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 3871#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))] [2018-02-02 10:00:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:44,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:44,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:44,157 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-02-02 10:00:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:44,378 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-02-02 10:00:44,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:44,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 10:00:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:44,379 INFO L225 Difference]: With dead ends: 364 [2018-02-02 10:00:44,379 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 10:00:44,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 10:00:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-02-02 10:00:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 10:00:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2018-02-02 10:00:44,384 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 25 [2018-02-02 10:00:44,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:44,385 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2018-02-02 10:00:44,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:44,385 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2018-02-02 10:00:44,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:00:44,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:44,386 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] [2018-02-02 10:00:44,386 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:44,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605704, now seen corresponding path program 1 times [2018-02-02 10:00:44,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:44,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:44,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:44,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,421 INFO L182 omatonBuilderFactory]: Interpolants [4448#false, 4449#(= 1 (select |#valid| main_~n~0.base)), 4450#(= 1 (select |#valid| main_~pred~0.base)), 4447#true] [2018-02-02 10:00:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:44,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:44,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:44,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:44,422 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 4 states. [2018-02-02 10:00:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:44,544 INFO L93 Difference]: Finished difference Result 250 states and 283 transitions. [2018-02-02 10:00:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:00:44,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 10:00:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:44,545 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:00:44,545 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:00:44,545 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:00:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:00:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-02-02 10:00:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:00:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 238 transitions. [2018-02-02 10:00:44,549 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 238 transitions. Word has length 27 [2018-02-02 10:00:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:44,549 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 238 transitions. [2018-02-02 10:00:44,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2018-02-02 10:00:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:00:44,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:44,550 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] [2018-02-02 10:00:44,550 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605703, now seen corresponding path program 1 times [2018-02-02 10:00:44,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:44,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:00:44,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:44,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:00:44,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:44,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:00:44,635 INFO L182 omatonBuilderFactory]: Interpolants [4912#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 4913#(and (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 4914#(and (or (and (= |main_~#sentinel~0.base| main_~root~0.base) (= |main_~#sentinel~0.offset| main_~root~0.offset)) (= 8 (select |#length| main_~root~0.base))) (= 0 main_~root~0.offset)), 4915#(and (= 0 main_~n~0.offset) (or (= 8 (select |#length| main_~n~0.base)) (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base)))), 4916#(and (= 0 main_~n~0.offset) (= 8 (select |#length| main_~n~0.base))), 4917#(and (= 0 main_~pred~0.offset) (= 8 (select |#length| main_~pred~0.base))), 4910#true, 4911#false] [2018-02-02 10:00:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:00:44,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:00:44,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:00:44,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:44,635 INFO L87 Difference]: Start difference. First operand 207 states and 238 transitions. Second operand 8 states. [2018-02-02 10:00:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:44,936 INFO L93 Difference]: Finished difference Result 317 states and 353 transitions. [2018-02-02 10:00:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:00:44,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 10:00:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:44,938 INFO L225 Difference]: With dead ends: 317 [2018-02-02 10:00:44,938 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 10:00:44,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:00:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 10:00:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 211. [2018-02-02 10:00:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 10:00:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 244 transitions. [2018-02-02 10:00:44,941 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 244 transitions. Word has length 27 [2018-02-02 10:00:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:44,941 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 244 transitions. [2018-02-02 10:00:44,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:00:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 244 transitions. [2018-02-02 10:00:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:00:44,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:44,942 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] [2018-02-02 10:00:44,942 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2086546122, now seen corresponding path program 1 times [2018-02-02 10:00:44,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:44,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:45,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:00:45,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,041 INFO L182 omatonBuilderFactory]: Interpolants [5456#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 5457#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 5458#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 5459#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 5460#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base)), 5454#true, 5455#false] [2018-02-02 10:00:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:00:45,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:00:45,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:00:45,042 INFO L87 Difference]: Start difference. First operand 211 states and 244 transitions. Second operand 7 states. [2018-02-02 10:00:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:45,314 INFO L93 Difference]: Finished difference Result 343 states and 382 transitions. [2018-02-02 10:00:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:45,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:00:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:45,315 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:00:45,316 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:00:45,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:00:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2018-02-02 10:00:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:00:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2018-02-02 10:00:45,318 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 27 [2018-02-02 10:00:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:45,318 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2018-02-02 10:00:45,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:00:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2018-02-02 10:00:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:45,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:45,319 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] [2018-02-02 10:00:45,319 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:45,319 INFO L82 PathProgramCache]: Analyzing trace with hash -260268355, now seen corresponding path program 1 times [2018-02-02 10:00:45,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:45,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:45,354 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:00:45,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:45,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:00:45,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,355 INFO L182 omatonBuilderFactory]: Interpolants [6035#true, 6036#false, 6037#(= |main_#t~malloc0.offset| 0), 6038#(= main_~root~0.offset 0), 6039#(= |main_~#sentinel~0.offset| main_~root~0.offset), 6040#(= |main_~#sentinel~0.offset| main_~n~0.offset), 6041#(not (= |main_~#sentinel~0.base| main_~n~0.base)), 6042#(not (= |main_~#sentinel~0.base| main_~pred~0.base))] [2018-02-02 10:00:45,355 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:00:45,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:00:45,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:00:45,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:45,355 INFO L87 Difference]: Start difference. First operand 223 states and 256 transitions. Second operand 8 states. [2018-02-02 10:00:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:45,487 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2018-02-02 10:00:45,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:45,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 10:00:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:45,488 INFO L225 Difference]: With dead ends: 304 [2018-02-02 10:00:45,488 INFO L226 Difference]: Without dead ends: 304 [2018-02-02 10:00:45,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-02 10:00:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 221. [2018-02-02 10:00:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 10:00:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2018-02-02 10:00:45,491 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 28 [2018-02-02 10:00:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:45,492 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2018-02-02 10:00:45,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:00:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2018-02-02 10:00:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:45,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:45,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:45,493 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248235, now seen corresponding path program 1 times [2018-02-02 10:00:45,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:45,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:45,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:45,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,567 INFO L182 omatonBuilderFactory]: Interpolants [6582#true, 6583#false, 6584#(= (select |#valid| main_~root~0.base) 1), 6585#(= (select |#valid| main_~n~0.base) 1), 6586#(and (= 1 (select |#valid| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|))), 6587#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6588#(and (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6589#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 6590#(= 1 (select |#valid| |main_#t~mem17.base|))] [2018-02-02 10:00:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:45,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:45,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:45,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:45,568 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 9 states. [2018-02-02 10:00:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:46,024 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2018-02-02 10:00:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:46,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:00:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:46,025 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:00:46,025 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:00:46,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:00:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 220. [2018-02-02 10:00:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 10:00:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-02-02 10:00:46,030 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 28 [2018-02-02 10:00:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:46,030 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-02-02 10:00:46,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-02-02 10:00:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:00:46,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:46,034 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:46,034 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248234, now seen corresponding path program 1 times [2018-02-02 10:00:46,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:46,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:46,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:46,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,140 INFO L182 omatonBuilderFactory]: Interpolants [7104#(= (select |#valid| main_~n~0.base) 1), 7105#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 7106#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7107#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7108#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 7109#(and (= (select |#length| |main_#t~mem17.base|) 8) (= |main_#t~mem17.offset| 0)), 7101#true, 7102#false, 7103#(= (select |#valid| main_~root~0.base) 1)] [2018-02-02 10:00:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:46,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:46,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:46,141 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 9 states. [2018-02-02 10:00:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:46,549 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-02-02 10:00:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:46,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 10:00:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:46,550 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:00:46,550 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:00:46,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:00:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2018-02-02 10:00:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:00:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2018-02-02 10:00:46,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 28 [2018-02-02 10:00:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:46,554 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2018-02-02 10:00:46,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2018-02-02 10:00:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:00:46,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:46,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:46,554 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776421, now seen corresponding path program 1 times [2018-02-02 10:00:46,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:46,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:46,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:46,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,593 INFO L182 omatonBuilderFactory]: Interpolants [7618#true, 7619#false, 7620#(= 1 (select |#valid| |main_#t~malloc22.base|)), 7621#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 7622#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 10:00:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:46,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:46,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:46,594 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand 5 states. [2018-02-02 10:00:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:46,816 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2018-02-02 10:00:46,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:46,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:00:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:46,818 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:00:46,818 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:00:46,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:00:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 218. [2018-02-02 10:00:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:00:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-02-02 10:00:46,822 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 29 [2018-02-02 10:00:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:46,822 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-02-02 10:00:46,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-02-02 10:00:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:00:46,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:46,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:46,823 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776422, now seen corresponding path program 1 times [2018-02-02 10:00:46,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:46,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:46,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:00:46,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,871 INFO L182 omatonBuilderFactory]: Interpolants [8194#true, 8195#false, 8196#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 8197#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 8198#(and (= (select |#length| |main_#t~mem24.base|) 8) (= |main_#t~mem24.offset| 0))] [2018-02-02 10:00:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:46,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:00:46,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:00:46,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:00:46,872 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 5 states. [2018-02-02 10:00:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:47,168 INFO L93 Difference]: Finished difference Result 380 states and 431 transitions. [2018-02-02 10:00:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:00:47,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 10:00:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:47,170 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:00:47,170 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:00:47,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:00:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:00:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 217. [2018-02-02 10:00:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 10:00:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-02-02 10:00:47,174 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 29 [2018-02-02 10:00:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:47,174 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-02-02 10:00:47,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:00:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-02-02 10:00:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:00:47,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:47,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:47,175 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash 901972539, now seen corresponding path program 1 times [2018-02-02 10:00:47,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:47,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:47,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:47,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,291 INFO L182 omatonBuilderFactory]: Interpolants [8802#true, 8803#false, 8804#(= (select |#valid| main_~root~0.base) 1), 8805#(= (select |#valid| main_~n~0.base) 1), 8806#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 8807#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 8808#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|))), 8809#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 8810#(and (= (select |#length| |main_#t~mem26.base|) 8) (= |main_#t~mem26.offset| 0))] [2018-02-02 10:00:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:47,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:47,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:47,292 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 9 states. [2018-02-02 10:00:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:47,783 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2018-02-02 10:00:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:47,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:00:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:47,784 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:00:47,784 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:00:47,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:00:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-02-02 10:00:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:00:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-02-02 10:00:47,788 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 32 [2018-02-02 10:00:47,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:47,788 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-02-02 10:00:47,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:47,788 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-02-02 10:00:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:00:47,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:47,788 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:47,789 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:47,789 INFO L82 PathProgramCache]: Analyzing trace with hash 901972538, now seen corresponding path program 1 times [2018-02-02 10:00:47,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:47,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:47,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:00:47,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,864 INFO L182 omatonBuilderFactory]: Interpolants [9283#true, 9284#false, 9285#(= (select |#valid| main_~root~0.base) 1), 9286#(= (select |#valid| main_~n~0.base) 1), 9287#(and (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|))), 9288#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 9289#(and (not (= main_~n~0.base |main_#t~mem24.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 9290#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 9291#(= 1 (select |#valid| |main_#t~mem26.base|))] [2018-02-02 10:00:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:47,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:00:47,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:00:47,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:00:47,865 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 9 states. [2018-02-02 10:00:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:48,195 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2018-02-02 10:00:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:00:48,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 10:00:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:48,196 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:00:48,196 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:00:48,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:00:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:00:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-02-02 10:00:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 10:00:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2018-02-02 10:00:48,199 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 32 [2018-02-02 10:00:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:48,200 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2018-02-02 10:00:48,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:00:48,200 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2018-02-02 10:00:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:00:48,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:48,200 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] [2018-02-02 10:00:48,200 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1252448966, now seen corresponding path program 1 times [2018-02-02 10:00:48,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:48,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:48,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:48,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:00:48,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:48,350 INFO L182 omatonBuilderFactory]: Interpolants [9762#true, 9763#false, 9764#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)))), 9765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 9766#(and (= 0 |main_#t~mem30.offset|) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 9767#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset))), 9768#(and (= 0 (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 9769#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 9770#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 9771#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base))] [2018-02-02 10:00:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:48,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:00:48,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:00:48,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:00:48,350 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand 10 states. [2018-02-02 10:00:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:48,739 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2018-02-02 10:00:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:48,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-02 10:00:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:48,740 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:00:48,740 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:00:48,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:00:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:00:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2018-02-02 10:00:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:00:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 253 transitions. [2018-02-02 10:00:48,743 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 253 transitions. Word has length 37 [2018-02-02 10:00:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:48,744 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 253 transitions. [2018-02-02 10:00:48,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:00:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 253 transitions. [2018-02-02 10:00:48,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:00:48,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:48,745 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] [2018-02-02 10:00:48,745 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:48,745 INFO L82 PathProgramCache]: Analyzing trace with hash 126757974, now seen corresponding path program 2 times [2018-02-02 10:00:48,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:48,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:49,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:00:49,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,064 INFO L182 omatonBuilderFactory]: Interpolants [10283#true, 10284#false, 10285#(= 0 |main_#t~malloc0.offset|), 10286#(= main_~root~0.offset 0), 10287#(and (= |main_~#sentinel~0.offset| main_~pred~0.offset) (= |main_~#sentinel~0.base| main_~pred~0.base) (= main_~n~0.offset 0)), 10288#(and (= 0 main_~n~0.offset) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ 0 4))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ 0 4)))), 10289#(and (= 0 main_~pred~0.offset) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) (+ 0 4))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) (+ 0 4)))), 10290#(and (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 10291#(and (= |main_~#sentinel~0.base| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)) (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset))), 10292#(and (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 10293#(and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 10294#(and (= |main_~#sentinel~0.base| |main_#t~mem28.base|) (= |main_~#sentinel~0.offset| |main_#t~mem28.offset|)), 10295#(and (= |main_~#sentinel~0.offset| main_~succ~0.offset) (= |main_~#sentinel~0.base| main_~succ~0.base)), 10296#(and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base))] [2018-02-02 10:00:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:00:49,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:00:49,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:00:49,065 INFO L87 Difference]: Start difference. First operand 225 states and 253 transitions. Second operand 14 states. [2018-02-02 10:00:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:49,575 INFO L93 Difference]: Finished difference Result 361 states and 400 transitions. [2018-02-02 10:00:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:00:49,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 10:00:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:49,577 INFO L225 Difference]: With dead ends: 361 [2018-02-02 10:00:49,577 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 10:00:49,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:00:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 10:00:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2018-02-02 10:00:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 10:00:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2018-02-02 10:00:49,582 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 47 [2018-02-02 10:00:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:49,582 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2018-02-02 10:00:49,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:00:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2018-02-02 10:00:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:49,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:49,583 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-02-02 10:00:49,583 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -365471073, now seen corresponding path program 1 times [2018-02-02 10:00:49,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:49,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:00:49,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:49,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:00:49,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:49,640 INFO L182 omatonBuilderFactory]: Interpolants [10951#true, 10952#false, 10953#(and (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset main_~n~0.offset)), 10954#(and (= main_~root~0.offset main_~pred~0.offset) (= main_~root~0.base main_~pred~0.base))] [2018-02-02 10:00:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:00:49,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:49,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:49,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:49,641 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand 4 states. [2018-02-02 10:00:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:49,727 INFO L93 Difference]: Finished difference Result 344 states and 380 transitions. [2018-02-02 10:00:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:49,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-02 10:00:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:49,728 INFO L225 Difference]: With dead ends: 344 [2018-02-02 10:00:49,728 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 10:00:49,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 10:00:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 260. [2018-02-02 10:00:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 10:00:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 292 transitions. [2018-02-02 10:00:49,732 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 292 transitions. Word has length 48 [2018-02-02 10:00:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:49,732 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 292 transitions. [2018-02-02 10:00:49,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 292 transitions. [2018-02-02 10:00:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:49,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:49,733 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] [2018-02-02 10:00:49,733 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:49,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1428269570, now seen corresponding path program 1 times [2018-02-02 10:00:49,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:49,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:50,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:00:50,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,077 INFO L182 omatonBuilderFactory]: Interpolants [11559#true, 11560#false, 11561#(= (select |#valid| 0) 0), 11562#(and (= (select |#valid| 0) 0) (= (select |#valid| main_~root~0.base) 1)), 11563#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| 0) 0) (= 1 (select |#valid| main_~n~0.base)) (= main_~n~0.offset main_~root~0.offset)), 11564#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| 0) 0) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|) (= main_~n~0.offset main_~root~0.offset)), 11565#(and (= (select |#valid| main_~n~0.base) 1) (or |main_#t~short6| (and (= main_~n~0.base main_~root~0.base) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)))), 11566#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 11567#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 11568#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 11569#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 11570#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (or (= 1 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 11571#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 11572#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 11573#(and (= 0 |main_#t~mem4.base|) (or (= |main_#t~mem4.offset| 0) (= 1 (select |#valid| 0))) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|)), 11574#(or (not |main_#t~short6|) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 11575#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 11576#(and (= 0 |main_#t~mem8.base|) (= 1 (select |#valid| 0))), 11577#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:00:50,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:00:50,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:00:50,078 INFO L87 Difference]: Start difference. First operand 260 states and 292 transitions. Second operand 19 states. [2018-02-02 10:00:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:50,818 INFO L93 Difference]: Finished difference Result 350 states and 394 transitions. [2018-02-02 10:00:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:00:50,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 10:00:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:50,819 INFO L225 Difference]: With dead ends: 350 [2018-02-02 10:00:50,820 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:00:50,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:00:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:00:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 283. [2018-02-02 10:00:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 10:00:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 319 transitions. [2018-02-02 10:00:50,823 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 319 transitions. Word has length 48 [2018-02-02 10:00:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:50,823 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 319 transitions. [2018-02-02 10:00:50,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:00:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 319 transitions. [2018-02-02 10:00:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:50,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:50,824 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] [2018-02-02 10:00:50,824 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211522, now seen corresponding path program 1 times [2018-02-02 10:00:50,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:50,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:50,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:50,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,942 INFO L182 omatonBuilderFactory]: Interpolants [12237#true, 12238#false, 12239#(= (select |#valid| main_~root~0.base) 1), 12240#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 12241#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 12242#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base)), 12243#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|))), 12244#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base)), 12245#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base)), 12246#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 12247#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 12248#(= 1 (select |#valid| |main_#t~mem8.base|)), 12249#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:00:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:50,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:50,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:50,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:50,943 INFO L87 Difference]: Start difference. First operand 283 states and 319 transitions. Second operand 13 states. [2018-02-02 10:00:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:51,547 INFO L93 Difference]: Finished difference Result 535 states and 621 transitions. [2018-02-02 10:00:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:00:51,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:00:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:51,549 INFO L225 Difference]: With dead ends: 535 [2018-02-02 10:00:51,549 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 10:00:51,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 10:00:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 328. [2018-02-02 10:00:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 10:00:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 387 transitions. [2018-02-02 10:00:51,554 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 387 transitions. Word has length 48 [2018-02-02 10:00:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:51,555 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 387 transitions. [2018-02-02 10:00:51,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 387 transitions. [2018-02-02 10:00:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:51,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:51,556 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] [2018-02-02 10:00:51,556 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211521, now seen corresponding path program 1 times [2018-02-02 10:00:51,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:51,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:51,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:51,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:00:51,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:51,729 INFO L182 omatonBuilderFactory]: Interpolants [13135#true, 13136#false, 13137#(= (select |#valid| main_~root~0.base) 1), 13138#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 13139#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 13140#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13141#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13142#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 13143#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 13144#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 13145#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 13146#(and (= 0 |main_#t~mem8.offset|) (= 8 (select |#length| |main_#t~mem8.base|))), 13147#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:51,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:00:51,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:00:51,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:00:51,730 INFO L87 Difference]: Start difference. First operand 328 states and 387 transitions. Second operand 13 states. [2018-02-02 10:00:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:52,510 INFO L93 Difference]: Finished difference Result 585 states and 682 transitions. [2018-02-02 10:00:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:00:52,510 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 10:00:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:52,511 INFO L225 Difference]: With dead ends: 585 [2018-02-02 10:00:52,511 INFO L226 Difference]: Without dead ends: 585 [2018-02-02 10:00:52,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:00:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-02 10:00:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 348. [2018-02-02 10:00:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:00:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 411 transitions. [2018-02-02 10:00:52,515 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 411 transitions. Word has length 48 [2018-02-02 10:00:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:52,515 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 411 transitions. [2018-02-02 10:00:52,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:00:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 411 transitions. [2018-02-02 10:00:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:00:52,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:52,516 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] [2018-02-02 10:00:52,516 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1737485884, now seen corresponding path program 1 times [2018-02-02 10:00:52,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:52,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:52,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:52,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:00:52,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:52,669 INFO L182 omatonBuilderFactory]: Interpolants [14112#(and (= main_~n~0.offset 0) (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 14113#(and (= main_~n~0.offset 0) (not |main_#t~short6|)), 14103#true, 14104#false, 14105#(= 0 |main_#t~malloc0.offset|), 14106#(= main_~root~0.offset 0), 14107#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 14108#(and (= |main_#t~mem19.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 14109#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)) (not |main_#t~short21|)), 14110#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 14111#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))] [2018-02-02 10:00:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:52,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:00:52,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:00:52,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:00:52,669 INFO L87 Difference]: Start difference. First operand 348 states and 411 transitions. Second operand 11 states. [2018-02-02 10:00:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:53,087 INFO L93 Difference]: Finished difference Result 460 states and 551 transitions. [2018-02-02 10:00:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:00:53,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 10:00:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:53,089 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:00:53,089 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 10:00:53,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:00:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 10:00:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 396. [2018-02-02 10:00:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 10:00:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 472 transitions. [2018-02-02 10:00:53,092 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 472 transitions. Word has length 48 [2018-02-02 10:00:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:53,093 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 472 transitions. [2018-02-02 10:00:53,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:00:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 472 transitions. [2018-02-02 10:00:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:00:53,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:53,093 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-02-02 10:00:53,094 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1693063, now seen corresponding path program 1 times [2018-02-02 10:00:53,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:53,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:00:53,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:53,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:53,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,120 INFO L182 omatonBuilderFactory]: Interpolants [14994#true, 14995#false, 14996#(= 1 (select |#valid| |main_#t~malloc33.base|)), 14997#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 10:00:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:00:53,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:53,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:53,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:53,121 INFO L87 Difference]: Start difference. First operand 396 states and 472 transitions. Second operand 4 states. [2018-02-02 10:00:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:53,205 INFO L93 Difference]: Finished difference Result 408 states and 485 transitions. [2018-02-02 10:00:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:00:53,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 10:00:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:53,207 INFO L225 Difference]: With dead ends: 408 [2018-02-02 10:00:53,207 INFO L226 Difference]: Without dead ends: 408 [2018-02-02 10:00:53,207 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:00:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-02 10:00:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 397. [2018-02-02 10:00:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 10:00:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 475 transitions. [2018-02-02 10:00:53,210 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 475 transitions. Word has length 51 [2018-02-02 10:00:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:53,211 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 475 transitions. [2018-02-02 10:00:53,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 475 transitions. [2018-02-02 10:00:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:00:53,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:53,211 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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] [2018-02-02 10:00:53,211 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1693062, now seen corresponding path program 1 times [2018-02-02 10:00:53,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:53,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:00:53,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:00:53,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:00:53,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,255 INFO L182 omatonBuilderFactory]: Interpolants [15808#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0)), 15805#true, 15806#false, 15807#(and (= 0 |main_#t~malloc33.offset|) (= 8 (select |#length| |main_#t~malloc33.base|)))] [2018-02-02 10:00:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:00:53,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:00:53,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:00:53,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:00:53,255 INFO L87 Difference]: Start difference. First operand 397 states and 475 transitions. Second operand 4 states. [2018-02-02 10:00:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:53,335 INFO L93 Difference]: Finished difference Result 401 states and 477 transitions. [2018-02-02 10:00:53,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:00:53,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 10:00:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:53,336 INFO L225 Difference]: With dead ends: 401 [2018-02-02 10:00:53,336 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 10:00:53,336 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:00:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 10:00:53,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2018-02-02 10:00:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 10:00:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 472 transitions. [2018-02-02 10:00:53,340 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 472 transitions. Word has length 51 [2018-02-02 10:00:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:53,340 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 472 transitions. [2018-02-02 10:00:53,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:00:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 472 transitions. [2018-02-02 10:00:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:00:53,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:53,341 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:53,341 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 579321489, now seen corresponding path program 1 times [2018-02-02 10:00:53,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:53,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:53,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:53,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,587 INFO L182 omatonBuilderFactory]: Interpolants [16608#false, 16609#(= (select |#valid| main_~root~0.base) 1), 16610#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 16611#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem4.base|) (= main_~n~0.offset main_~root~0.offset)), 16612#(and (= (select |#valid| main_~n~0.base) 1) (or |main_#t~short6| (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)))), 16613#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 16614#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 16615#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 16616#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 16617#(and (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 16618#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 16619#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 16620#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 16621#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 16622#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base)), 16607#true] [2018-02-02 10:00:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:53,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:00:53,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:00:53,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:00:53,588 INFO L87 Difference]: Start difference. First operand 395 states and 472 transitions. Second operand 16 states. [2018-02-02 10:00:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:54,167 INFO L93 Difference]: Finished difference Result 500 states and 591 transitions. [2018-02-02 10:00:54,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:00:54,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-02-02 10:00:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:54,168 INFO L225 Difference]: With dead ends: 500 [2018-02-02 10:00:54,168 INFO L226 Difference]: Without dead ends: 500 [2018-02-02 10:00:54,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:00:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-02-02 10:00:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 407. [2018-02-02 10:00:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 10:00:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 484 transitions. [2018-02-02 10:00:54,173 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 484 transitions. Word has length 51 [2018-02-02 10:00:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:54,173 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 484 transitions. [2018-02-02 10:00:54,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:00:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 484 transitions. [2018-02-02 10:00:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:00:54,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:54,174 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:54,174 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1647796079, now seen corresponding path program 1 times [2018-02-02 10:00:54,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:54,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:54,508 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:00:54,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:54,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:54,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:54,508 INFO L182 omatonBuilderFactory]: Interpolants [17568#(and (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 17569#(and (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 17570#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (and (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))), 17571#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 17572#(or (= 1 (select |#valid| |main_#t~mem28.base|)) (and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 17573#(or (= 1 (select |#valid| main_~succ~0.base)) (and (= main_~succ~0.offset (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~succ~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 17574#(or (= 1 (select |#valid| main_~succ~0.base)) (and (= |main_~#sentinel~0.offset| main_~succ~0.offset) (= |main_~#sentinel~0.base| main_~succ~0.base))), 17575#(or (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base)) (= 1 (select |#valid| main_~n~0.base))), 17576#(= 1 (select |#valid| main_~n~0.base)), 17560#true, 17561#false, 17562#(= (select |#valid| main_~root~0.base) 1), 17563#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 17564#(and (= main_~n~0.base main_~root~0.base) (= |main_#t~malloc13.offset| 0) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 17565#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 17566#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset) 0) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 17567#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset))] [2018-02-02 10:00:54,508 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:00:54,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:54,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:54,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:54,509 INFO L87 Difference]: Start difference. First operand 407 states and 484 transitions. Second operand 17 states. [2018-02-02 10:00:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:55,479 INFO L93 Difference]: Finished difference Result 795 states and 937 transitions. [2018-02-02 10:00:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:00:55,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-02 10:00:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:55,480 INFO L225 Difference]: With dead ends: 795 [2018-02-02 10:00:55,480 INFO L226 Difference]: Without dead ends: 795 [2018-02-02 10:00:55,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:00:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-02-02 10:00:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 439. [2018-02-02 10:00:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 10:00:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 524 transitions. [2018-02-02 10:00:55,487 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 524 transitions. Word has length 51 [2018-02-02 10:00:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:55,487 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 524 transitions. [2018-02-02 10:00:55,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 524 transitions. [2018-02-02 10:00:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:00:55,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:55,488 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:00:55,488 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1647796078, now seen corresponding path program 1 times [2018-02-02 10:00:55,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:55,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:55,780 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:00:55,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:55,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:55,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:55,781 INFO L182 omatonBuilderFactory]: Interpolants [18849#true, 18850#false, 18851#(= (select |#valid| main_~root~0.base) 1), 18852#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 18853#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 18854#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 18855#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 8 (select |#length| |main_#t~mem15.base|)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 18856#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset) 0) (= main_~n~0.offset main_~root~0.offset)), 18857#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 18858#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 0)), 18859#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (and (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 18860#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 18861#(and (= 0 |main_#t~mem28.offset|) (or (= 8 (select |#length| |main_#t~mem28.base|)) (and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))))), 18862#(and (= 0 main_~succ~0.offset) (or (= 8 (select |#length| main_~succ~0.base)) (and (= main_~succ~0.offset (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~succ~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))))), 18863#(and (or (= 8 (select |#length| main_~succ~0.base)) (and (= |main_~#sentinel~0.offset| main_~succ~0.offset) (= |main_~#sentinel~0.base| main_~succ~0.base))) (= 0 main_~succ~0.offset)), 18864#(and (or (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base)) (= (select |#length| main_~n~0.base) 8)) (= main_~n~0.offset 0)), 18865#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:00:55,781 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:00:55,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:55,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:55,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:55,781 INFO L87 Difference]: Start difference. First operand 439 states and 524 transitions. Second operand 17 states. [2018-02-02 10:00:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:56,987 INFO L93 Difference]: Finished difference Result 846 states and 991 transitions. [2018-02-02 10:00:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:00:56,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-02 10:00:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:56,989 INFO L225 Difference]: With dead ends: 846 [2018-02-02 10:00:56,989 INFO L226 Difference]: Without dead ends: 846 [2018-02-02 10:00:56,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:00:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-02-02 10:00:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 445. [2018-02-02 10:00:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 10:00:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 530 transitions. [2018-02-02 10:00:56,994 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 530 transitions. Word has length 51 [2018-02-02 10:00:56,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:56,994 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 530 transitions. [2018-02-02 10:00:56,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 530 transitions. [2018-02-02 10:00:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:56,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:56,995 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] [2018-02-02 10:00:56,995 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1619324790, now seen corresponding path program 1 times [2018-02-02 10:00:56,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:57,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:57,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:57,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:00:57,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:57,221 INFO L182 omatonBuilderFactory]: Interpolants [20192#false, 20193#(= (select |#valid| main_~root~0.base) 1), 20194#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 20195#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 20196#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 20197#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 20198#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 20199#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 20200#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset)), 20201#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 20202#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 20203#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 20204#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 20205#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 20206#(= 1 (select |#valid| |main_#t~mem8.base|)), 20207#(= 1 (select |#valid| main_~n~0.base)), 20191#true] [2018-02-02 10:00:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:57,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:00:57,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:00:57,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:00:57,222 INFO L87 Difference]: Start difference. First operand 445 states and 530 transitions. Second operand 17 states. [2018-02-02 10:00:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:00:58,302 INFO L93 Difference]: Finished difference Result 1062 states and 1280 transitions. [2018-02-02 10:00:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:00:58,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 10:00:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:00:58,304 INFO L225 Difference]: With dead ends: 1062 [2018-02-02 10:00:58,304 INFO L226 Difference]: Without dead ends: 1062 [2018-02-02 10:00:58,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=566, Invalid=1504, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:00:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-02-02 10:00:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 517. [2018-02-02 10:00:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-02-02 10:00:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2018-02-02 10:00:58,310 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 56 [2018-02-02 10:00:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:00:58,310 INFO L432 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2018-02-02 10:00:58,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:00:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2018-02-02 10:00:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:00:58,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:00:58,311 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] [2018-02-02 10:00:58,311 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:00:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1619324789, now seen corresponding path program 1 times [2018-02-02 10:00:58,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:00:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:00:58,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:00:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:58,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:00:58,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:00:58,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:00:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:58,596 INFO L182 omatonBuilderFactory]: Interpolants [21856#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 21857#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 21858#(and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 21859#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))), 21860#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 21861#(and (= 0 |main_#t~mem8.offset|) (<= 8 (select |#length| |main_#t~mem8.base|))), 21862#(and (= main_~n~0.offset 0) (<= 8 (select |#length| main_~n~0.base))), 21845#true, 21846#false, 21847#(= (select |#valid| main_~root~0.base) 1), 21848#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 21849#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 21850#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 21851#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#length| |main_#t~mem15.base|) 8) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 21852#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 21853#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 21854#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 21855#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset))] [2018-02-02 10:00:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:00:58,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:00:58,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:00:58,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:00:58,596 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand 18 states. [2018-02-02 10:01:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:00,068 INFO L93 Difference]: Finished difference Result 1119 states and 1349 transitions. [2018-02-02 10:01:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:01:00,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-02-02 10:01:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:00,070 INFO L225 Difference]: With dead ends: 1119 [2018-02-02 10:01:00,070 INFO L226 Difference]: Without dead ends: 1119 [2018-02-02 10:01:00,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=519, Invalid=1737, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:01:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-02-02 10:01:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 533. [2018-02-02 10:01:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-02 10:01:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 654 transitions. [2018-02-02 10:01:00,075 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 654 transitions. Word has length 56 [2018-02-02 10:01:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:00,076 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 654 transitions. [2018-02-02 10:01:00,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:01:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 654 transitions. [2018-02-02 10:01:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:01:00,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:00,076 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] [2018-02-02 10:01:00,076 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1613599152, now seen corresponding path program 1 times [2018-02-02 10:01:00,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:00,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:00,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:00,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:00,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:00,259 INFO L182 omatonBuilderFactory]: Interpolants [23584#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 23585#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 23586#(and (= main_~n~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 23587#(= 1 (select |#valid| |main_#t~mem9.base|)), 23588#(= 1 (select |#valid| main_~n~0.base)), 23575#true, 23576#false, 23577#(= 0 |main_#t~malloc0.offset|), 23578#(= main_~root~0.offset 0), 23579#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 23580#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 23581#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 23582#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 23583#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 10:01:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:00,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:00,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:00,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:00,260 INFO L87 Difference]: Start difference. First operand 533 states and 654 transitions. Second operand 14 states. [2018-02-02 10:01:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:00,834 INFO L93 Difference]: Finished difference Result 1002 states and 1223 transitions. [2018-02-02 10:01:00,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:01:00,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:01:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:00,836 INFO L225 Difference]: With dead ends: 1002 [2018-02-02 10:01:00,836 INFO L226 Difference]: Without dead ends: 1002 [2018-02-02 10:01:00,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=601, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:01:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-02-02 10:01:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 591. [2018-02-02 10:01:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-02 10:01:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 737 transitions. [2018-02-02 10:01:00,841 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 737 transitions. Word has length 56 [2018-02-02 10:01:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:00,842 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 737 transitions. [2018-02-02 10:01:00,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 737 transitions. [2018-02-02 10:01:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:01:00,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:00,842 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] [2018-02-02 10:01:00,842 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1613599151, now seen corresponding path program 1 times [2018-02-02 10:01:00,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:00,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:01,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:01,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:01,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:01,079 INFO L182 omatonBuilderFactory]: Interpolants [25216#(= 0 |main_#t~malloc0.offset|), 25217#(= main_~root~0.offset 0), 25218#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 25219#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 25220#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 25221#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 25222#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 25223#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 25224#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 25225#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0)), 25226#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 25227#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 25214#true, 25215#false] [2018-02-02 10:01:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:01,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:01:01,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:01:01,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:01:01,080 INFO L87 Difference]: Start difference. First operand 591 states and 737 transitions. Second operand 14 states. [2018-02-02 10:01:01,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:01,923 INFO L93 Difference]: Finished difference Result 1074 states and 1313 transitions. [2018-02-02 10:01:01,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:01:01,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 10:01:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:01,925 INFO L225 Difference]: With dead ends: 1074 [2018-02-02 10:01:01,925 INFO L226 Difference]: Without dead ends: 1074 [2018-02-02 10:01:01,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:01:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-02-02 10:01:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 605. [2018-02-02 10:01:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-02-02 10:01:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 756 transitions. [2018-02-02 10:01:01,932 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 756 transitions. Word has length 56 [2018-02-02 10:01:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:01,932 INFO L432 AbstractCegarLoop]: Abstraction has 605 states and 756 transitions. [2018-02-02 10:01:01,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:01:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 756 transitions. [2018-02-02 10:01:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:01:01,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:01,933 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:01,933 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 753453542, now seen corresponding path program 3 times [2018-02-02 10:01:01,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:01,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:02,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:02,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:01:02,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:02,095 INFO L182 omatonBuilderFactory]: Interpolants [26944#(and (not (= main_~pred~0.base 0)) (= main_~n~0.offset 0)), 26945#(and (= 0 main_~n~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ 0 4)) 0))), 26946#(and (= 0 main_~pred~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~pred~0.base) (+ 0 4)) 0))), 26947#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0)), 26948#(and (= main_~n~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset) 0))), 26949#(not (= (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset) 0)), 26950#(not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0)), 26951#(not (= |main_#t~mem28.base| 0)), 26952#(not (= main_~succ~0.base 0)), 26953#(not (= main_~n~0.base 0)), 26939#true, 26940#false, 26941#(= 0 |main_#t~malloc0.offset|), 26942#(= main_~root~0.offset 0), 26943#(and (= main_~root~0.offset 0) (not (= |main_~#sentinel~0.base| 0)))] [2018-02-02 10:01:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:02,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:02,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:02,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:02,096 INFO L87 Difference]: Start difference. First operand 605 states and 756 transitions. Second operand 15 states. [2018-02-02 10:01:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:02,573 INFO L93 Difference]: Finished difference Result 680 states and 833 transitions. [2018-02-02 10:01:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:01:02,573 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-02 10:01:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:02,575 INFO L225 Difference]: With dead ends: 680 [2018-02-02 10:01:02,575 INFO L226 Difference]: Without dead ends: 680 [2018-02-02 10:01:02,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:01:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-02-02 10:01:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 595. [2018-02-02 10:01:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-02-02 10:01:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 744 transitions. [2018-02-02 10:01:02,579 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 744 transitions. Word has length 57 [2018-02-02 10:01:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:02,579 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 744 transitions. [2018-02-02 10:01:02,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 744 transitions. [2018-02-02 10:01:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:01:02,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:02,580 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1] [2018-02-02 10:01:02,580 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash -685645087, now seen corresponding path program 1 times [2018-02-02 10:01:02,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:02,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:02,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:02,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:02,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:02,737 INFO L182 omatonBuilderFactory]: Interpolants [28272#(= 1 (select |#valid| main_~st~0.base)), 28269#true, 28270#false, 28271#(= (select |#valid| main_~s~0.base) 1)] [2018-02-02 10:01:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:02,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:02,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:02,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:02,738 INFO L87 Difference]: Start difference. First operand 595 states and 744 transitions. Second operand 4 states. [2018-02-02 10:01:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:02,901 INFO L93 Difference]: Finished difference Result 612 states and 762 transitions. [2018-02-02 10:01:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:02,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-02-02 10:01:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:02,902 INFO L225 Difference]: With dead ends: 612 [2018-02-02 10:01:02,902 INFO L226 Difference]: Without dead ends: 612 [2018-02-02 10:01:02,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-02-02 10:01:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 594. [2018-02-02 10:01:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-02-02 10:01:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 744 transitions. [2018-02-02 10:01:02,907 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 744 transitions. Word has length 57 [2018-02-02 10:01:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:02,907 INFO L432 AbstractCegarLoop]: Abstraction has 594 states and 744 transitions. [2018-02-02 10:01:02,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 744 transitions. [2018-02-02 10:01:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:01:02,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:02,908 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1] [2018-02-02 10:01:02,908 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash -685645086, now seen corresponding path program 1 times [2018-02-02 10:01:02,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:02,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:02,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:02,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:02,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:02,946 INFO L182 omatonBuilderFactory]: Interpolants [29481#true, 29482#false, 29483#(and (= 0 |main_#t~malloc33.offset|) (= 8 (select |#length| |main_#t~malloc33.base|))), 29484#(and (= 0 main_~s~0.offset) (= 8 (select |#length| main_~s~0.base))), 29485#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:01:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:02,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:02,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:02,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:02,947 INFO L87 Difference]: Start difference. First operand 594 states and 744 transitions. Second operand 5 states. [2018-02-02 10:01:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:03,171 INFO L93 Difference]: Finished difference Result 621 states and 771 transitions. [2018-02-02 10:01:03,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:01:03,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-02-02 10:01:03,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:03,174 INFO L225 Difference]: With dead ends: 621 [2018-02-02 10:01:03,174 INFO L226 Difference]: Without dead ends: 621 [2018-02-02 10:01:03,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:01:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-02 10:01:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 596. [2018-02-02 10:01:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 10:01:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 745 transitions. [2018-02-02 10:01:03,180 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 745 transitions. Word has length 57 [2018-02-02 10:01:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:03,180 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 745 transitions. [2018-02-02 10:01:03,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 745 transitions. [2018-02-02 10:01:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:01:03,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:03,181 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:03,181 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 219806186, now seen corresponding path program 1 times [2018-02-02 10:01:03,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:03,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:03,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:03,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:03,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:03,207 INFO L182 omatonBuilderFactory]: Interpolants [30709#true, 30710#false, 30711#(not (= |main_#t~malloc33.base| 0)), 30712#(not (= main_~s~0.base 0))] [2018-02-02 10:01:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:03,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:03,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:03,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:03,207 INFO L87 Difference]: Start difference. First operand 596 states and 745 transitions. Second operand 4 states. [2018-02-02 10:01:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:03,221 INFO L93 Difference]: Finished difference Result 596 states and 744 transitions. [2018-02-02 10:01:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:03,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-02-02 10:01:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:03,222 INFO L225 Difference]: With dead ends: 596 [2018-02-02 10:01:03,222 INFO L226 Difference]: Without dead ends: 596 [2018-02-02 10:01:03,222 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:01:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-02-02 10:01:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2018-02-02 10:01:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 10:01:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 744 transitions. [2018-02-02 10:01:03,228 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 744 transitions. Word has length 58 [2018-02-02 10:01:03,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:03,228 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 744 transitions. [2018-02-02 10:01:03,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 744 transitions. [2018-02-02 10:01:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:01:03,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:03,231 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:03,231 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash -315070331, now seen corresponding path program 1 times [2018-02-02 10:01:03,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:03,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:03,775 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:01:03,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:03,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:01:03,775 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:03,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:01:03,776 INFO L182 omatonBuilderFactory]: Interpolants [31907#true, 31908#false, 31909#(= (select |#valid| main_~root~0.base) 1), 31910#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 31911#(and (= main_~n~0.base main_~root~0.base) (= |main_#t~malloc13.offset| 0) (= 1 (select |#valid| |main_#t~malloc13.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|))), 31912#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 31913#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 31914#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset) 0) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 31915#(and (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 31916#(and (= (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset) 0) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~n~0.offset main_~root~0.offset)), 31917#(and (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 31918#(and (= main_~n~0.base main_~root~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 31919#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset) 0)), 31920#(and (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 31921#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (and (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))), 31922#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 31923#(or (= 1 (select |#valid| |main_#t~mem28.base|)) (and (= |main_~#sentinel~0.base| |main_#t~mem28.base|) (= |main_~#sentinel~0.offset| |main_#t~mem28.offset|))), 31924#(or (= 1 (select |#valid| main_~succ~0.base)) (and (= |main_~#sentinel~0.offset| main_~succ~0.offset) (= |main_~#sentinel~0.base| main_~succ~0.base))), 31925#(or (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base)) (= 1 (select |#valid| main_~n~0.base))), 31926#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:01:03,776 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:01:03,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:01:03,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:01:03,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:01:03,776 INFO L87 Difference]: Start difference. First operand 596 states and 744 transitions. Second operand 20 states. [2018-02-02 10:01:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:05,459 INFO L93 Difference]: Finished difference Result 1157 states and 1411 transitions. [2018-02-02 10:01:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 10:01:05,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-02-02 10:01:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:05,461 INFO L225 Difference]: With dead ends: 1157 [2018-02-02 10:01:05,461 INFO L226 Difference]: Without dead ends: 1157 [2018-02-02 10:01:05,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:01:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2018-02-02 10:01:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 610. [2018-02-02 10:01:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-02-02 10:01:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 760 transitions. [2018-02-02 10:01:05,466 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 760 transitions. Word has length 59 [2018-02-02 10:01:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:05,466 INFO L432 AbstractCegarLoop]: Abstraction has 610 states and 760 transitions. [2018-02-02 10:01:05,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:01:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 760 transitions. [2018-02-02 10:01:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:01:05,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:05,467 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:05,467 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -315070330, now seen corresponding path program 1 times [2018-02-02 10:01:05,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:05,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:01:05,895 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:01:05,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:05,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:01:05,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:05,896 INFO L182 omatonBuilderFactory]: Interpolants [33792#(and (= 0 main_~succ~0.offset) (or (and (= |main_~#sentinel~0.offset| main_~succ~0.offset) (= |main_~#sentinel~0.base| main_~succ~0.base)) (<= 8 (select |#length| main_~succ~0.base)))), 33793#(and (or (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base)) (<= 8 (select |#length| main_~n~0.base))) (= main_~n~0.offset 0)), 33794#(and (= main_~n~0.offset 0) (<= 8 (select |#length| main_~n~0.base))), 33774#true, 33775#false, 33776#(= (select |#valid| main_~root~0.base) 1), 33777#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 33778#(and (= 8 (select |#length| |main_#t~malloc13.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 33779#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33780#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= (select |#length| |main_#t~mem15.base|) 8) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33781#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33782#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33783#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33784#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 33785#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 33786#(and (= main_~n~0.base main_~root~0.base) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~n~0.offset main_~root~0.offset)), 33787#(and (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))), 33788#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 0)), 33789#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (or (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (and (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))))), 33790#(and (or (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 33791#(and (= 0 |main_#t~mem28.offset|) (or (and (= |main_~#sentinel~0.base| |main_#t~mem28.base|) (= |main_~#sentinel~0.offset| |main_#t~mem28.offset|)) (<= 8 (select |#length| |main_#t~mem28.base|))))] [2018-02-02 10:01:05,896 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:01:05,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:01:05,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:01:05,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:01:05,896 INFO L87 Difference]: Start difference. First operand 610 states and 760 transitions. Second operand 21 states. [2018-02-02 10:01:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:07,890 INFO L93 Difference]: Finished difference Result 1205 states and 1462 transitions. [2018-02-02 10:01:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:01:07,890 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-02-02 10:01:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:07,892 INFO L225 Difference]: With dead ends: 1205 [2018-02-02 10:01:07,893 INFO L226 Difference]: Without dead ends: 1205 [2018-02-02 10:01:07,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=687, Invalid=2853, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:01:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-02-02 10:01:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 578. [2018-02-02 10:01:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 10:01:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2018-02-02 10:01:07,898 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 59 [2018-02-02 10:01:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:07,898 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2018-02-02 10:01:07,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:01:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2018-02-02 10:01:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:01:07,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:07,899 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:07,899 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 811848755, now seen corresponding path program 1 times [2018-02-02 10:01:07,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:07,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:01:08,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:08,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:01:08,139 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:08,140 INFO L182 omatonBuilderFactory]: Interpolants [35656#true, 35657#false, 35658#(= 0 |main_#t~malloc0.offset|), 35659#(= main_~root~0.offset 0), 35660#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset 0)), 35661#(and (= main_~root~0.offset 0) (= main_~pred~0.base main_~root~0.base)), 35662#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 35663#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 35664#(and (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base)) (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0)), 35665#(and (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (not (= main_~s~0.base 0)) (= main_~root~0.offset main_~s~0.offset) (= main_~root~0.offset 0)), 35666#(and (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 35667#(and (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 35668#(and (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (not (= main_~st~0.base 0))), 35669#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= main_~st~0.base 0))), 35670#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 10:01:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:01:08,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:01:08,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:01:08,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:01:08,141 INFO L87 Difference]: Start difference. First operand 578 states and 720 transitions. Second operand 15 states. [2018-02-02 10:01:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:08,637 INFO L93 Difference]: Finished difference Result 629 states and 778 transitions. [2018-02-02 10:01:08,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:01:08,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-02 10:01:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:08,638 INFO L225 Difference]: With dead ends: 629 [2018-02-02 10:01:08,638 INFO L226 Difference]: Without dead ends: 629 [2018-02-02 10:01:08,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:01:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-02 10:01:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 579. [2018-02-02 10:01:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-02-02 10:01:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 722 transitions. [2018-02-02 10:01:08,642 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 722 transitions. Word has length 60 [2018-02-02 10:01:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:08,642 INFO L432 AbstractCegarLoop]: Abstraction has 579 states and 722 transitions. [2018-02-02 10:01:08,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:01:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 722 transitions. [2018-02-02 10:01:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:01:08,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:08,643 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:08,643 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash 811848756, now seen corresponding path program 1 times [2018-02-02 10:01:08,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:08,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:01:08,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:08,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:01:08,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:08,955 INFO L182 omatonBuilderFactory]: Interpolants [36911#true, 36912#false, 36913#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 36914#(and (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 36915#(and (or (and (= |main_~#sentinel~0.base| main_~root~0.base) (= |main_~#sentinel~0.offset| main_~root~0.offset)) (= 8 (select |#length| main_~root~0.base))) (= main_~root~0.offset 0)), 36916#(and (= main_~n~0.base main_~root~0.base) (or (= 8 (select |#length| main_~n~0.base)) (and (= |main_~#sentinel~0.offset| main_~n~0.offset) (= |main_~#sentinel~0.base| main_~n~0.base))) (= main_~root~0.offset 0)), 36917#(and (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.offset 0)), 36918#(and (= main_~root~0.base main_~pred~0.base) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 36919#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 36920#(and (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 36921#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 36922#(and (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))), 36923#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0)), 36924#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 36925#(and (= 0 |main_#t~mem37.offset|) (= 8 (select |#length| |main_#t~mem37.base|)) (= main_~st~0.offset 0)), 36926#(and (= main_~n~0.offset 0) (= main_~st~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 36927#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 10:01:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:01:08,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:01:08,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:01:08,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:01:08,956 INFO L87 Difference]: Start difference. First operand 579 states and 722 transitions. Second operand 17 states. [2018-02-02 10:01:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:09,634 INFO L93 Difference]: Finished difference Result 667 states and 817 transitions. [2018-02-02 10:01:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:09,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-02-02 10:01:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:09,636 INFO L225 Difference]: With dead ends: 667 [2018-02-02 10:01:09,636 INFO L226 Difference]: Without dead ends: 667 [2018-02-02 10:01:09,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:01:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-02-02 10:01:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 595. [2018-02-02 10:01:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-02-02 10:01:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 745 transitions. [2018-02-02 10:01:09,641 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 745 transitions. Word has length 60 [2018-02-02 10:01:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:09,641 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 745 transitions. [2018-02-02 10:01:09,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:01:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 745 transitions. [2018-02-02 10:01:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:01:09,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:09,642 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:09,642 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:09,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1665732193, now seen corresponding path program 1 times [2018-02-02 10:01:09,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:09,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:10,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:10,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:01:10,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:10,092 INFO L182 omatonBuilderFactory]: Interpolants [38240#(and (= main_~n~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset)) (= |main_~#sentinel~0.offset| 0) (or (= |main_~#sentinel~0.base| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset))))), 38241#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 38242#(and (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 38243#(and (= 0 |main_#t~mem28.offset|) (= |main_~#sentinel~0.offset| 0) (or (= 1 (select |#valid| |main_#t~mem28.base|)) (= |main_~#sentinel~0.base| |main_#t~mem28.base|))), 38244#(and (= 0 main_~succ~0.offset) (= |main_~#sentinel~0.offset| 0) (or (= 1 (select |#valid| main_~succ~0.base)) (= |main_~#sentinel~0.base| main_~succ~0.base))), 38245#(and (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| 0) (or (= 1 (select |#valid| main_~n~0.base)) (= |main_~#sentinel~0.base| main_~n~0.base))), 38246#(and (= |main_~#sentinel~0.offset| main_~n~0.offset) (or (= 1 (select |#valid| main_~n~0.base)) (= |main_~#sentinel~0.base| main_~n~0.base))), 38247#(= 1 (select |#valid| main_~n~0.base)), 38226#true, 38227#false, 38228#(= 0 |main_#t~malloc0.offset|), 38229#(= main_~root~0.offset 0), 38230#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 38231#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 38232#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 38233#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 38234#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 38235#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 38236#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 38237#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 38238#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| 0) (or (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 38239#(and (or (and (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| |main_#t~mem30.base|))) (= 0 |main_#t~mem30.offset|) (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| 0))] [2018-02-02 10:01:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:10,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:01:10,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:01:10,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:01:10,093 INFO L87 Difference]: Start difference. First operand 595 states and 745 transitions. Second operand 22 states. [2018-02-02 10:01:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:12,005 INFO L93 Difference]: Finished difference Result 1120 states and 1358 transitions. [2018-02-02 10:01:12,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:01:12,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 10:01:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:12,007 INFO L225 Difference]: With dead ends: 1120 [2018-02-02 10:01:12,007 INFO L226 Difference]: Without dead ends: 1120 [2018-02-02 10:01:12,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=724, Invalid=2936, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:01:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-02-02 10:01:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 711. [2018-02-02 10:01:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-02-02 10:01:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 887 transitions. [2018-02-02 10:01:12,012 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 887 transitions. Word has length 61 [2018-02-02 10:01:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:12,013 INFO L432 AbstractCegarLoop]: Abstraction has 711 states and 887 transitions. [2018-02-02 10:01:12,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:01:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 887 transitions. [2018-02-02 10:01:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:01:12,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:12,013 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:12,013 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1665732194, now seen corresponding path program 1 times [2018-02-02 10:01:12,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:12,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:12,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:12,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:01:12,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:12,482 INFO L182 omatonBuilderFactory]: Interpolants [40160#(= main_~root~0.offset 0), 40161#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 40162#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 40163#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 40164#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 40165#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 40166#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 40167#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 40168#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 40169#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= |main_~#sentinel~0.offset| 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 40170#(and (= 0 |main_#t~mem30.offset|) (= main_~n~0.offset 0) (or (and (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 8 (select |#length| |main_#t~mem30.base|))) (= |main_~#sentinel~0.offset| 0)), 40171#(and (or (= |main_~#sentinel~0.base| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)) (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)))) (= main_~n~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset)) (= |main_~#sentinel~0.offset| 0)), 40172#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 40173#(and (= |main_~#sentinel~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 40174#(and (= 0 |main_#t~mem28.offset|) (= |main_~#sentinel~0.offset| 0) (or (= 8 (select |#length| |main_#t~mem28.base|)) (= |main_~#sentinel~0.base| |main_#t~mem28.base|))), 40175#(and (= 0 main_~succ~0.offset) (or (= 8 (select |#length| main_~succ~0.base)) (= |main_~#sentinel~0.base| main_~succ~0.base)) (= |main_~#sentinel~0.offset| 0)), 40176#(and (= main_~n~0.offset 0) (or (and (= |main_~#sentinel~0.offset| 0) (= |main_~#sentinel~0.base| main_~n~0.base)) (= (select |#length| main_~n~0.base) 8))), 40177#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 40157#true, 40158#false, 40159#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:01:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:12,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:01:12,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:01:12,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:01:12,483 INFO L87 Difference]: Start difference. First operand 711 states and 887 transitions. Second operand 21 states. [2018-02-02 10:01:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:14,406 INFO L93 Difference]: Finished difference Result 1150 states and 1399 transitions. [2018-02-02 10:01:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:01:14,406 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 10:01:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:14,408 INFO L225 Difference]: With dead ends: 1150 [2018-02-02 10:01:14,408 INFO L226 Difference]: Without dead ends: 1150 [2018-02-02 10:01:14,409 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=2266, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:01:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-02-02 10:01:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 709. [2018-02-02 10:01:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-02-02 10:01:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 884 transitions. [2018-02-02 10:01:14,414 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 884 transitions. Word has length 61 [2018-02-02 10:01:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:14,414 INFO L432 AbstractCegarLoop]: Abstraction has 709 states and 884 transitions. [2018-02-02 10:01:14,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:01:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 884 transitions. [2018-02-02 10:01:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:01:14,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:14,415 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:14,415 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1269338015, now seen corresponding path program 1 times [2018-02-02 10:01:14,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:14,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:14,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:14,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:01:14,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:14,572 INFO L182 omatonBuilderFactory]: Interpolants [42112#(not (= 0 main_~succ~0.base)), 42113#(not (= 0 main_~n~0.base)), 42101#true, 42102#false, 42103#(= (select |#valid| main_~root~0.base) 1), 42104#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 42105#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (not (= 0 |main_#t~malloc13.base|))), 42106#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 42107#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 42108#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)))), 42109#(not (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 42110#(not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 42111#(not (= 0 |main_#t~mem28.base|))] [2018-02-02 10:01:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:01:14,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:01:14,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:01:14,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:01:14,573 INFO L87 Difference]: Start difference. First operand 709 states and 884 transitions. Second operand 13 states. [2018-02-02 10:01:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:15,294 INFO L93 Difference]: Finished difference Result 1118 states and 1358 transitions. [2018-02-02 10:01:15,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:01:15,295 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-02 10:01:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:15,297 INFO L225 Difference]: With dead ends: 1118 [2018-02-02 10:01:15,297 INFO L226 Difference]: Without dead ends: 1095 [2018-02-02 10:01:15,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:01:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-02-02 10:01:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 741. [2018-02-02 10:01:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-02-02 10:01:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 923 transitions. [2018-02-02 10:01:15,304 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 923 transitions. Word has length 61 [2018-02-02 10:01:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:15,304 INFO L432 AbstractCegarLoop]: Abstraction has 741 states and 923 transitions. [2018-02-02 10:01:15,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:01:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 923 transitions. [2018-02-02 10:01:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:01:15,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:15,305 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:15,305 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2014452450, now seen corresponding path program 1 times [2018-02-02 10:01:15,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:15,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:01:15,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:15,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:15,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:15,344 INFO L182 omatonBuilderFactory]: Interpolants [44005#true, 44006#false, 44007#(<= 0 main_~n~0.offset), 44008#(and (<= (+ main_~n~0.offset 8) (select |#length| main_~n~0.base)) (<= 0 main_~n~0.offset)), 44009#(and (<= 0 main_~pred~0.offset) (<= (+ main_~pred~0.offset 8) (select |#length| main_~pred~0.base)))] [2018-02-02 10:01:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:01:15,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:15,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:15,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:15,345 INFO L87 Difference]: Start difference. First operand 741 states and 923 transitions. Second operand 5 states. [2018-02-02 10:01:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:15,461 INFO L93 Difference]: Finished difference Result 793 states and 983 transitions. [2018-02-02 10:01:15,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:01:15,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-02-02 10:01:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:15,463 INFO L225 Difference]: With dead ends: 793 [2018-02-02 10:01:15,463 INFO L226 Difference]: Without dead ends: 793 [2018-02-02 10:01:15,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:01:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-02-02 10:01:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 735. [2018-02-02 10:01:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-02-02 10:01:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 914 transitions. [2018-02-02 10:01:15,467 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 914 transitions. Word has length 61 [2018-02-02 10:01:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:15,468 INFO L432 AbstractCegarLoop]: Abstraction has 735 states and 914 transitions. [2018-02-02 10:01:15,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 914 transitions. [2018-02-02 10:01:15,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:01:15,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:15,468 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:15,468 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2014512031, now seen corresponding path program 2 times [2018-02-02 10:01:15,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:15,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:16,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:01:16,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,043 INFO L182 omatonBuilderFactory]: Interpolants [45543#true, 45544#false, 45545#(= (select |#valid| main_~root~0.base) 1), 45546#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~root~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 45547#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 45548#(and (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 45549#(and (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~mem15.offset|) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 45550#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 45551#(and (or (and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)) (and (= main_~n~0.base main_~root~0.base) (= |main_#t~mem17.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset)) (= (+ |main_#t~mem17.offset| 4) 0))) (not (= main_~root~0.base |main_#t~mem17.base|))), 45552#(or (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 4) 0)), 45553#(or (<= (+ (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset) 4) 0) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))))), 45554#(or (and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))) (<= (+ (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 4) 0)), 45555#(or (and (not (= main_~n~0.base |main_#t~mem28.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) |main_#t~mem28.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) |main_#t~mem28.offset|))) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 4) 0) (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 45556#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) main_~succ~0.offset)) (not (= main_~n~0.base main_~succ~0.base))) (and (= main_~succ~0.offset (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 4) 0))), 45557#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset)) main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base)) main_~succ~0.base) main_~succ~0.offset))) (<= (+ main_~succ~0.offset 4) 0)), 45558#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) main_~succ~0.offset))) (<= (+ main_~succ~0.offset 4) 0)), 45559#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (<= (+ main_~n~0.offset 4) 0)), 45560#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 45561#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 45562#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base))] [2018-02-02 10:01:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:16,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:01:16,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:01:16,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:01:16,044 INFO L87 Difference]: Start difference. First operand 735 states and 914 transitions. Second operand 20 states. [2018-02-02 10:01:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,694 INFO L93 Difference]: Finished difference Result 1104 states and 1342 transitions. [2018-02-02 10:01:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:01:17,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-02 10:01:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,697 INFO L225 Difference]: With dead ends: 1104 [2018-02-02 10:01:17,697 INFO L226 Difference]: Without dead ends: 1104 [2018-02-02 10:01:17,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:01:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2018-02-02 10:01:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 745. [2018-02-02 10:01:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-02-02 10:01:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 925 transitions. [2018-02-02 10:01:17,704 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 925 transitions. Word has length 61 [2018-02-02 10:01:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,704 INFO L432 AbstractCegarLoop]: Abstraction has 745 states and 925 transitions. [2018-02-02 10:01:17,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:01:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 925 transitions. [2018-02-02 10:01:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:01:17,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,705 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:17,705 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1976484492, now seen corresponding path program 1 times [2018-02-02 10:01:17,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:01:17,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:01:17,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,738 INFO L182 omatonBuilderFactory]: Interpolants [47464#true, 47465#false, 47466#(or (not (= |main_~#sentinel~0.offset| main_~n~0.offset)) (not (= |main_~#sentinel~0.base| main_~n~0.base))), 47467#(or (not (= |main_~#sentinel~0.base| main_~pred~0.base)) (not (= |main_~#sentinel~0.offset| main_~pred~0.offset)))] [2018-02-02 10:01:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:01:17,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:17,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:17,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:17,738 INFO L87 Difference]: Start difference. First operand 745 states and 925 transitions. Second operand 4 states. [2018-02-02 10:01:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,798 INFO L93 Difference]: Finished difference Result 752 states and 931 transitions. [2018-02-02 10:01:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:17,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-02-02 10:01:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,800 INFO L225 Difference]: With dead ends: 752 [2018-02-02 10:01:17,800 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 10:01:17,800 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:01:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 10:01:17,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 745. [2018-02-02 10:01:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-02-02 10:01:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 924 transitions. [2018-02-02 10:01:17,807 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 924 transitions. Word has length 62 [2018-02-02 10:01:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,808 INFO L432 AbstractCegarLoop]: Abstraction has 745 states and 924 transitions. [2018-02-02 10:01:17,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 924 transitions. [2018-02-02 10:01:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:01:17,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,808 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:17,808 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -176167627, now seen corresponding path program 1 times [2018-02-02 10:01:17,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:17,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:17,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,829 INFO L182 omatonBuilderFactory]: Interpolants [48968#true, 48969#false, 48970#(= 1 (select |#valid| |main_#t~malloc39.base|)), 48971#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 10:01:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:17,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:17,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:17,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:17,830 INFO L87 Difference]: Start difference. First operand 745 states and 924 transitions. Second operand 4 states. [2018-02-02 10:01:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:17,901 INFO L93 Difference]: Finished difference Result 771 states and 954 transitions. [2018-02-02 10:01:17,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:17,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-02-02 10:01:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:17,904 INFO L225 Difference]: With dead ends: 771 [2018-02-02 10:01:17,904 INFO L226 Difference]: Without dead ends: 771 [2018-02-02 10:01:17,904 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:01:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-02 10:01:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 744. [2018-02-02 10:01:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-02-02 10:01:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 922 transitions. [2018-02-02 10:01:17,911 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 922 transitions. Word has length 64 [2018-02-02 10:01:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:17,911 INFO L432 AbstractCegarLoop]: Abstraction has 744 states and 922 transitions. [2018-02-02 10:01:17,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 922 transitions. [2018-02-02 10:01:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:01:17,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:17,912 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:17,912 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash -176167626, now seen corresponding path program 1 times [2018-02-02 10:01:17,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:17,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:17,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:17,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:17,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:17,940 INFO L182 omatonBuilderFactory]: Interpolants [50489#true, 50490#false, 50491#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 50492#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:01:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:17,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:17,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:17,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:17,941 INFO L87 Difference]: Start difference. First operand 744 states and 922 transitions. Second operand 4 states. [2018-02-02 10:01:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,035 INFO L93 Difference]: Finished difference Result 803 states and 986 transitions. [2018-02-02 10:01:18,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:18,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-02-02 10:01:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,037 INFO L225 Difference]: With dead ends: 803 [2018-02-02 10:01:18,037 INFO L226 Difference]: Without dead ends: 803 [2018-02-02 10:01:18,037 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:01:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-02 10:01:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 742. [2018-02-02 10:01:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-02-02 10:01:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 918 transitions. [2018-02-02 10:01:18,043 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 918 transitions. Word has length 64 [2018-02-02 10:01:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,043 INFO L432 AbstractCegarLoop]: Abstraction has 742 states and 918 transitions. [2018-02-02 10:01:18,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 918 transitions. [2018-02-02 10:01:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:01:18,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,044 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:18,044 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1378113097, now seen corresponding path program 1 times [2018-02-02 10:01:18,044 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:18,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:18,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:18,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,064 INFO L182 omatonBuilderFactory]: Interpolants [52041#true, 52042#false, 52043#(= 1 (select |#valid| |main_#t~malloc44.base|)), 52044#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 10:01:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:18,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:18,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:18,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:18,065 INFO L87 Difference]: Start difference. First operand 742 states and 918 transitions. Second operand 4 states. [2018-02-02 10:01:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,136 INFO L93 Difference]: Finished difference Result 756 states and 933 transitions. [2018-02-02 10:01:18,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:18,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-02-02 10:01:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,137 INFO L225 Difference]: With dead ends: 756 [2018-02-02 10:01:18,137 INFO L226 Difference]: Without dead ends: 756 [2018-02-02 10:01:18,137 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:01:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-02 10:01:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 741. [2018-02-02 10:01:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-02-02 10:01:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 916 transitions. [2018-02-02 10:01:18,142 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 916 transitions. Word has length 66 [2018-02-02 10:01:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,143 INFO L432 AbstractCegarLoop]: Abstraction has 741 states and 916 transitions. [2018-02-02 10:01:18,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 916 transitions. [2018-02-02 10:01:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:01:18,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,143 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:18,143 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1378113096, now seen corresponding path program 1 times [2018-02-02 10:01:18,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:18,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:01:18,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:01:18,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,191 INFO L182 omatonBuilderFactory]: Interpolants [53544#true, 53545#false, 53546#(and (= 8 (select |#length| |main_#t~malloc44.base|)) (= 0 |main_#t~malloc44.offset|)), 53547#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 10:01:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:18,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:01:18,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:01:18,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:01:18,192 INFO L87 Difference]: Start difference. First operand 741 states and 916 transitions. Second operand 4 states. [2018-02-02 10:01:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:18,305 INFO L93 Difference]: Finished difference Result 783 states and 958 transitions. [2018-02-02 10:01:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:01:18,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-02-02 10:01:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:18,306 INFO L225 Difference]: With dead ends: 783 [2018-02-02 10:01:18,306 INFO L226 Difference]: Without dead ends: 783 [2018-02-02 10:01:18,307 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:01:18,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-02-02 10:01:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 739. [2018-02-02 10:01:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-02-02 10:01:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 912 transitions. [2018-02-02 10:01:18,311 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 912 transitions. Word has length 66 [2018-02-02 10:01:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:18,311 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 912 transitions. [2018-02-02 10:01:18,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:01:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 912 transitions. [2018-02-02 10:01:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:01:18,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:18,312 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:18,312 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2019706376, now seen corresponding path program 2 times [2018-02-02 10:01:18,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:18,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:18,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:01:18,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,831 INFO L182 omatonBuilderFactory]: Interpolants [55073#true, 55074#false, 55075#(= (select |#valid| main_~root~0.base) 1), 55076#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 55077#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 55078#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 55079#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem15.offset| 0)), 55080#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 55081#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 55082#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 55083#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 55084#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 55085#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 55086#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 55087#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)))), 55088#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 55089#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem8.base|) |main_#t~mem8.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem8.base|) |main_#t~mem8.offset|))), 55090#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 55091#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 55092#(not |main_#t~short6|)] [2018-02-02 10:01:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:18,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:01:18,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:01:18,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:01:18,832 INFO L87 Difference]: Start difference. First operand 739 states and 912 transitions. Second operand 20 states. [2018-02-02 10:01:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:20,214 INFO L93 Difference]: Finished difference Result 1279 states and 1573 transitions. [2018-02-02 10:01:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:01:20,214 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-02-02 10:01:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:20,216 INFO L225 Difference]: With dead ends: 1279 [2018-02-02 10:01:20,216 INFO L226 Difference]: Without dead ends: 1279 [2018-02-02 10:01:20,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:01:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-02-02 10:01:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 849. [2018-02-02 10:01:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-02-02 10:01:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1061 transitions. [2018-02-02 10:01:20,226 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1061 transitions. Word has length 66 [2018-02-02 10:01:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:20,227 INFO L432 AbstractCegarLoop]: Abstraction has 849 states and 1061 transitions. [2018-02-02 10:01:20,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:01:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1061 transitions. [2018-02-02 10:01:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:01:20,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:20,228 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:20,228 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2063132610, now seen corresponding path program 1 times [2018-02-02 10:01:20,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:20,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:20,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:20,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:01:20,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:20,817 INFO L182 omatonBuilderFactory]: Interpolants [57280#(= main_~root~0.offset 0), 57281#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 57282#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 57283#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 57284#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 57285#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.offset| 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 57286#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 57287#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 57288#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 57289#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0))), 57290#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~mem5.offset|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= |main_#t~mem5.offset| 0)), 57291#(and (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))), 57292#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem9.base|) |main_#t~mem9.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem9.base|) |main_#t~mem9.offset|))), 57293#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 57294#(and (= |main_#t~mem4.offset| 0) (= 0 |main_#t~mem4.base|)), 57295#(not |main_#t~short6|), 57277#true, 57278#false, 57279#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:01:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:20,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:01:20,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:01:20,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:01:20,818 INFO L87 Difference]: Start difference. First operand 849 states and 1061 transitions. Second operand 19 states. [2018-02-02 10:01:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:21,938 INFO L93 Difference]: Finished difference Result 1235 states and 1511 transitions. [2018-02-02 10:01:21,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:01:21,939 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-02 10:01:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:21,940 INFO L225 Difference]: With dead ends: 1235 [2018-02-02 10:01:21,940 INFO L226 Difference]: Without dead ends: 1235 [2018-02-02 10:01:21,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:01:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-02-02 10:01:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 817. [2018-02-02 10:01:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-02-02 10:01:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1011 transitions. [2018-02-02 10:01:21,945 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1011 transitions. Word has length 66 [2018-02-02 10:01:21,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:21,945 INFO L432 AbstractCegarLoop]: Abstraction has 817 states and 1011 transitions. [2018-02-02 10:01:21,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:01:21,945 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1011 transitions. [2018-02-02 10:01:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:01:21,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:21,946 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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:01:21,946 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 241497805, now seen corresponding path program 1 times [2018-02-02 10:01:21,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:21,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:22,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:22,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:01:22,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,012 INFO L182 omatonBuilderFactory]: Interpolants [59408#(and (= 0 main_~s~0.base) (= main_~s~0.offset 0)), 59404#true, 59405#false, 59406#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base) main_~s~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset) main_~s~0.offset))), 59407#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|))] [2018-02-02 10:01:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 10:01:22,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:01:22,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:01:22,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:01:22,012 INFO L87 Difference]: Start difference. First operand 817 states and 1011 transitions. Second operand 5 states. [2018-02-02 10:01:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:22,064 INFO L93 Difference]: Finished difference Result 828 states and 1023 transitions. [2018-02-02 10:01:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:01:22,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 10:01:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:22,065 INFO L225 Difference]: With dead ends: 828 [2018-02-02 10:01:22,065 INFO L226 Difference]: Without dead ends: 828 [2018-02-02 10:01:22,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:01:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-02-02 10:01:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 822. [2018-02-02 10:01:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-02-02 10:01:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1017 transitions. [2018-02-02 10:01:22,069 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1017 transitions. Word has length 67 [2018-02-02 10:01:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:22,069 INFO L432 AbstractCegarLoop]: Abstraction has 822 states and 1017 transitions. [2018-02-02 10:01:22,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:01:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1017 transitions. [2018-02-02 10:01:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:01:22,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:22,069 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:22,070 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash 967862931, now seen corresponding path program 2 times [2018-02-02 10:01:22,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:22,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:22,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:01:22,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,595 INFO L182 omatonBuilderFactory]: Interpolants [61061#true, 61062#false, 61063#(= (select |#valid| main_~root~0.base) 1), 61064#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~root~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 61065#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 61066#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 61067#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem15.offset| 0)), 61068#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 61069#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= main_~n~0.offset main_~root~0.offset)), 61070#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 61071#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset) |main_#t~malloc22.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (not (= main_~root~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) main_~n~0.offset)))), 61072#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 61073#(and (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem24.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem24.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem24.base| (store (select |#memory_$Pointer$.base| |main_#t~mem24.base|) |main_#t~mem24.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 61074#(and (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) main_~root~0.offset)))), 61075#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 61076#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))), 61077#(and (not (= main_~n~0.base |main_#t~mem28.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) |main_#t~mem28.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) |main_#t~mem28.offset|))), 61078#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) main_~succ~0.offset)) (not (= main_~n~0.base main_~succ~0.base))), 61079#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset)) main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base)) main_~succ~0.base) main_~succ~0.offset))), 61080#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) main_~succ~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) main_~succ~0.offset))), 61081#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 61082#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 61083#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 61084#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base))] [2018-02-02 10:01:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:22,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:01:22,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:01:22,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:01:22,596 INFO L87 Difference]: Start difference. First operand 822 states and 1017 transitions. Second operand 24 states. [2018-02-02 10:01:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:24,466 INFO L93 Difference]: Finished difference Result 1264 states and 1536 transitions. [2018-02-02 10:01:24,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:01:24,466 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-02-02 10:01:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:24,467 INFO L225 Difference]: With dead ends: 1264 [2018-02-02 10:01:24,468 INFO L226 Difference]: Without dead ends: 1264 [2018-02-02 10:01:24,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=500, Invalid=2922, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:01:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2018-02-02 10:01:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 852. [2018-02-02 10:01:24,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-02-02 10:01:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1054 transitions. [2018-02-02 10:01:24,473 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1054 transitions. Word has length 69 [2018-02-02 10:01:24,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:24,474 INFO L432 AbstractCegarLoop]: Abstraction has 852 states and 1054 transitions. [2018-02-02 10:01:24,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:01:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1054 transitions. [2018-02-02 10:01:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:01:24,474 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:24,474 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:24,474 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash 391027005, now seen corresponding path program 1 times [2018-02-02 10:01:24,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:24,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:01:25,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:25,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:01:25,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:25,016 INFO L182 omatonBuilderFactory]: Interpolants [63271#true, 63272#false, 63273#(= 0 (select |#valid| 0)), 63274#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 63275#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 63276#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 63277#(and (= |main_~#sentinel~0.offset| main_~root~0.offset) (or (= |old(#valid)| (store (store |#valid| main_~root~0.base 0) |main_~#sentinel~0.base| 0)) (= |main_~#sentinel~0.base| main_~root~0.base)) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 63278#(and (or (and (= |old(#valid)| (store (store |#valid| main_~root~0.base 0) |main_~#sentinel~0.base| 0)) (= main_~n~0.base main_~root~0.base)) (= |main_~#sentinel~0.base| main_~n~0.base)) (= 0 (select |#valid| 0)) (= |main_~#sentinel~0.offset| main_~n~0.offset) (= main_~root~0.offset 0)), 63279#(and (= |old(#valid)| (store (store |#valid| main_~root~0.base 0) |main_~#sentinel~0.base| 0)) (= 0 (select |#valid| 0)) (not (= |main_~#sentinel~0.base| main_~root~0.base)) (= main_~root~0.offset 0)), 63280#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= (store (store (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base 0) |main_~#sentinel~0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= |main_~#sentinel~0.base| main_~root~0.base)) (= main_~root~0.offset 0)), 63281#(and (not (= main_~s~0.base 0)) (= (store (store (store |#valid| main_~s~0.base 0) main_~root~0.base 0) |main_~#sentinel~0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (not (= |main_~#sentinel~0.base| main_~root~0.base)) (= main_~root~0.offset 0)), 63282#(and (not (= main_~s~0.base 0)) (= (store (store (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) 0) |main_~#sentinel~0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (not (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))), 63283#(and (not (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= |old(#valid)| (store (store (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |main_~#sentinel~0.base| 0)) (not (= main_~st~0.base 0)) (= main_~s~0.offset main_~st~0.offset) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 63284#(and (not (= |main_~#sentinel~0.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= |old(#valid)| (store (store (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |main_~#sentinel~0.base| 0)) (not (= main_~st~0.base 0)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 63285#(and (not (= main_~st~0.base 0)) (= (store (store (store |#valid| main_~st~0.base 0) |main_#t~mem37.base| 0) |main_~#sentinel~0.base| 0) |old(#valid)|) (not (= |main_~#sentinel~0.base| |main_#t~mem37.base|)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 63286#(and (not (= main_~st~0.base 0)) (= (store (store (store |#valid| main_~st~0.base 0) main_~n~0.base 0) |main_~#sentinel~0.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= main_~n~0.base |main_~#sentinel~0.base|)) (= main_~st~0.offset 0)), 63287#(or (and (not (= main_~n~0.base 0)) (not (= main_~n~0.base |main_~#sentinel~0.base|)) (= (store (store |#valid| main_~n~0.base 0) |main_~#sentinel~0.base| 0) |old(#valid)|)) (= 0 (select |#valid| main_~n~0.base))), 63288#(and (not (= main_~n~0.base 0)) (not (= main_~n~0.base |main_~#sentinel~0.base|)) (= (store (store |#valid| main_~n~0.base 0) |main_~#sentinel~0.base| 0) |old(#valid)|)), 63289#(= |old(#valid)| (store |#valid| |main_~#sentinel~0.base| 0)), 63290#(= |#valid| |old(#valid)|)] [2018-02-02 10:01:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:01:25,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:01:25,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:01:25,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:01:25,016 INFO L87 Difference]: Start difference. First operand 852 states and 1054 transitions. Second operand 20 states. [2018-02-02 10:01:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:26,686 INFO L93 Difference]: Finished difference Result 892 states and 1095 transitions. [2018-02-02 10:01:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:01:26,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 10:01:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:26,687 INFO L225 Difference]: With dead ends: 892 [2018-02-02 10:01:26,687 INFO L226 Difference]: Without dead ends: 885 [2018-02-02 10:01:26,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:01:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-02-02 10:01:26,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2018-02-02 10:01:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-02-02 10:01:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1084 transitions. [2018-02-02 10:01:26,691 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1084 transitions. Word has length 70 [2018-02-02 10:01:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:26,691 INFO L432 AbstractCegarLoop]: Abstraction has 881 states and 1084 transitions. [2018-02-02 10:01:26,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:01:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1084 transitions. [2018-02-02 10:01:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:01:26,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:26,692 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:26,692 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1216320145, now seen corresponding path program 2 times [2018-02-02 10:01:26,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:26,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:01:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:27,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:01:27,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,370 INFO L182 omatonBuilderFactory]: Interpolants [65104#true, 65105#false, 65106#(= 0 |main_#t~malloc0.offset|), 65107#(= main_~root~0.offset 0), 65108#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 65109#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 65110#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 65111#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 65112#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem24.offset| 0) (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base |main_#t~mem24.base|)) (= main_~root~0.offset 0)), 65113#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 65114#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem26.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0) 0)) (not (= main_~root~0.base |main_#t~mem26.base|)) (= |main_#t~mem26.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem26.base| (store (select |#memory_$Pointer$.base| |main_#t~mem26.base|) (+ |main_#t~mem26.offset| 4) 0)) main_~root~0.base) (+ main_~root~0.offset 4)))), 65115#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 65116#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 65117#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~mem30.offset|)) |main_#t~mem30.base|) 0)) (= 0 |main_#t~mem30.offset|) (not (= main_~n~0.base |main_#t~mem30.base|)) (= main_~n~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~mem30.base|)) |main_#t~mem30.base|) 0))), 65118#(and (not (= main_~n~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset))) (= main_~n~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset)) 0))), 65119#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset)) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)))), 65120#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 0))), 65121#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) 0)) (= 0 |main_#t~mem28.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) 0)) (not (= main_~n~0.base |main_#t~mem28.base|))), 65122#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) 0)) (= 0 main_~succ~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) 0)) (not (= main_~n~0.base main_~succ~0.base))), 65123#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base)) main_~succ~0.base) 0)) (= 0 main_~succ~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset)) main_~succ~0.base) 0))), 65124#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) 0)) (= 0 main_~succ~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) 0))), 65125#(and (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 65126#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 65127#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 65128#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 65129#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base))] [2018-02-02 10:01:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:27,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:01:27,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:01:27,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:01:27,370 INFO L87 Difference]: Start difference. First operand 881 states and 1084 transitions. Second operand 26 states. [2018-02-02 10:01:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:01:29,453 INFO L93 Difference]: Finished difference Result 1308 states and 1590 transitions. [2018-02-02 10:01:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:01:29,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-02-02 10:01:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:01:29,454 INFO L225 Difference]: With dead ends: 1308 [2018-02-02 10:01:29,455 INFO L226 Difference]: Without dead ends: 1308 [2018-02-02 10:01:29,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=575, Invalid=3331, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:01:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-02-02 10:01:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 881. [2018-02-02 10:01:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-02-02 10:01:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1084 transitions. [2018-02-02 10:01:29,460 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1084 transitions. Word has length 71 [2018-02-02 10:01:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:01:29,460 INFO L432 AbstractCegarLoop]: Abstraction has 881 states and 1084 transitions. [2018-02-02 10:01:29,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:01:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1084 transitions. [2018-02-02 10:01:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:01:29,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:01:29,461 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:01:29,461 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:01:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1338235375, now seen corresponding path program 2 times [2018-02-02 10:01:29,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:01:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:01:29,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:01:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:01:29,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:01:29,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:01:29,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:01:29,951 INFO L182 omatonBuilderFactory]: Interpolants [67393#true, 67395#(= 0 |main_#t~malloc0.offset|), 67394#false, 67397#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 67396#(= main_~root~0.offset 0), 67399#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 67398#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 67401#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem15.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 67400#(and (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 67403#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ main_~root~0.offset 4))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 67402#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem17.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem17.base|) (+ |main_#t~mem17.offset| 4) 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem17.offset| 0) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 67405#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 67404#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 67407#(and (= 0 main_~succ~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) (+ 0 4))) (not (= main_~n~0.base main_~succ~0.base))), 67406#(and (= 0 |main_#t~mem28.offset|) (not (= main_~n~0.base |main_#t~mem28.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem28.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem28.base|) (+ 0 4)))), 67409#(and (= 0 main_~succ~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) (+ 0 4)))), 67408#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base)) main_~succ~0.base) (+ 0 4))) (= 0 main_~succ~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset)) main_~succ~0.base) (+ 0 4)))), 67411#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 67410#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0)), 67413#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.offset) main_~n~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) main_~pred~0.base) main_~n~0.offset))), 67412#(and (= 0 |main_#t~mem30.offset|) (= |main_#t~mem30.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 67415#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 67414#(and (= 0 (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset))), 67417#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base)), 67416#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base))] [2018-02-02 10:01:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:01:29,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:01:29,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:01:29,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:01:29,952 INFO L87 Difference]: Start difference. First operand 881 states and 1084 transitions. Second operand 25 states. Received shutdown request... [2018-02-02 10:01:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:01:30,368 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:01:30,372 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:01:30,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:01:30 BoogieIcfgContainer [2018-02-02 10:01:30,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:01:30,373 INFO L168 Benchmark]: Toolchain (without parser) took 48965.51 ms. Allocated memory was 410.5 MB in the beginning and 1.1 GB in the end (delta: 708.8 MB). Free memory was 367.2 MB in the beginning and 985.3 MB in the end (delta: -618.1 MB). Peak memory consumption was 90.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:30,374 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 410.5 MB. Free memory is still 372.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:01:30,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.66 ms. Allocated memory is still 410.5 MB. Free memory was 367.2 MB in the beginning and 354.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:30,374 INFO L168 Benchmark]: Boogie Preprocessor took 32.41 ms. Allocated memory is still 410.5 MB. Free memory is still 354.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:01:30,374 INFO L168 Benchmark]: RCFGBuilder took 463.65 ms. Allocated memory is still 410.5 MB. Free memory was 354.0 MB in the beginning and 307.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:30,374 INFO L168 Benchmark]: TraceAbstraction took 48298.08 ms. Allocated memory was 410.5 MB in the beginning and 1.1 GB in the end (delta: 708.8 MB). Free memory was 307.7 MB in the beginning and 985.3 MB in the end (delta: -677.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:01:30,375 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 410.5 MB. Free memory is still 372.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.66 ms. Allocated memory is still 410.5 MB. Free memory was 367.2 MB in the beginning and 354.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.41 ms. Allocated memory is still 410.5 MB. Free memory is still 354.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 463.65 ms. Allocated memory is still 410.5 MB. Free memory was 354.0 MB in the beginning and 307.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48298.08 ms. Allocated memory was 410.5 MB in the beginning and 1.1 GB in the end (delta: 708.8 MB). Free memory was 307.7 MB in the beginning and 985.3 MB in the end (delta: -677.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 683). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 685). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 689). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (881states) and interpolant automaton (currently 13 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (82 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 75 error locations. TIMEOUT Result, 48.2s OverallTime, 61 OverallIterations, 5 TraceHistogramMax, 36.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8183 SDtfs, 25174 SDslu, 39604 SDs, 0 SdLazy, 45609 SolverSat, 2894 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1420 GetRequests, 137 SyntacticMatches, 36 SemanticMatches, 1247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9843 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=881occurred in iteration=59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 650/1048 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 60 MinimizatonAttempts, 9860 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 2843 NumberOfCodeBlocks, 2843 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 2782 ConstructedInterpolants, 0 QuantifiedInterpolants, 1723797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 61 InterpolantComputations, 30 PerfectInterpolantSequences, 650/1048 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/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-01-30-381.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_dsw_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-01-30-381.csv Completed graceful shutdown