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/cade18-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-a74eeac-m [2018-02-02 20:09:33,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:09:33,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:09:33,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:09:33,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:09:33,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:09:33,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:09:33,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:09:33,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:09:33,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:09:33,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:09:33,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:09:33,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:09:33,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:09:33,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:09:33,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:09:33,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:09:33,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:09:33,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:09:33,151 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:09:33,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:09:33,153 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:09:33,154 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:09:33,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:09:33,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:09:33,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:09:33,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:09:33,157 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:09:33,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:09:33,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:09:33,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:09:33,158 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:09:33,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:09:33,168 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:09:33,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:09:33,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:09:33,169 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:09:33,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:09:33,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:09:33,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:09:33,171 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:09:33,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:09:33,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:09:33,209 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:09:33,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:09:33,210 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:09:33,211 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 20:09:33,333 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:09:33,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:09:33,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:09:33,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:09:33,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:09:33,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135a9ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33, skipping insertion in model container [2018-02-02 20:09:33,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,351 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:09:33,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:09:33,475 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:09:33,494 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:09:33,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33 WrapperNode [2018-02-02 20:09:33,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:09:33,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:09:33,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:09:33,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:09:33,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (1/1) ... [2018-02-02 20:09:33,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:09:33,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:09:33,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:09:33,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:09:33,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (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 20:09:33,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:09:33,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:09:33,573 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:09:33,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:09:33,959 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:09:33,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:09:33 BoogieIcfgContainer [2018-02-02 20:09:33,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:09:33,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:09:33,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:09:33,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:09:33,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:09:33" (1/3) ... [2018-02-02 20:09:33,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d37fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:09:33, skipping insertion in model container [2018-02-02 20:09:33,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:09:33" (2/3) ... [2018-02-02 20:09:33,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d37fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:09:33, skipping insertion in model container [2018-02-02 20:09:33,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:09:33" (3/3) ... [2018-02-02 20:09:33,965 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_dsw_true-valid-memsafety_false-termination.i [2018-02-02 20:09:33,971 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:09:33,981 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-02 20:09:34,014 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:09:34,014 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:09:34,015 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:09:34,015 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:09:34,015 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:09:34,015 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:09:34,015 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:09:34,015 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:09:34,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:09:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-02-02 20:09:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:09:34,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:34,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:34,040 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 20:09:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -985735074, now seen corresponding path program 1 times [2018-02-02 20:09:34,085 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:34,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:34,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 20:09:34,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:34,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:34,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,161 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 20:09:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:34,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:34,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:34,178 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 4 states. [2018-02-02 20:09:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:34,465 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 20:09:34,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:34,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:09:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:34,475 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:09:34,475 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 20:09:34,477 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 20:09:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 20:09:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-02-02 20:09:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 20:09:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2018-02-02 20:09:34,509 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 8 [2018-02-02 20:09:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:34,509 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2018-02-02 20:09:34,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2018-02-02 20:09:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:09:34,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:34,510 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:34,510 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 20:09:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash -985735073, now seen corresponding path program 1 times [2018-02-02 20:09:34,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:34,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:34,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:34,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,570 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 20:09:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:34,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:34,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:34,572 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand 4 states. [2018-02-02 20:09:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:34,713 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2018-02-02 20:09:34,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:34,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:09:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:34,715 INFO L225 Difference]: With dead ends: 166 [2018-02-02 20:09:34,715 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 20:09:34,716 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 20:09:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 20:09:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 20:09:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:09:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 20:09:34,721 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 8 [2018-02-02 20:09:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:34,722 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 20:09:34,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 20:09:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:09:34,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:34,723 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:34,723 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 20:09:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 473226571, now seen corresponding path program 1 times [2018-02-02 20:09:34,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:34,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:34,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:34,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,763 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 20:09:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:34,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:34,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:34,764 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-02-02 20:09:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:34,906 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 20:09:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:34,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 20:09:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:34,908 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:09:34,908 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:09:34,908 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 20:09:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:09:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 153. [2018-02-02 20:09:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 20:09:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-02-02 20:09:34,913 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 14 [2018-02-02 20:09:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:34,913 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-02-02 20:09:34,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2018-02-02 20:09:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:09:34,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:34,914 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:09:34,914 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 20:09:34,914 INFO L82 PathProgramCache]: Analyzing trace with hash 473226572, now seen corresponding path program 1 times [2018-02-02 20:09:34,915 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:34,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:34,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:34,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,980 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 20:09:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:34,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:34,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:34,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:34,980 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand 5 states. [2018-02-02 20:09:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,180 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2018-02-02 20:09:35,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:35,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:09:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,182 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:09:35,183 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:09:35,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 20:09:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:09:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 188. [2018-02-02 20:09:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:09:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-02-02 20:09:35,189 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 14 [2018-02-02 20:09:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,189 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-02-02 20:09:35,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-02-02 20:09:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:09:35,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,189 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 20:09:35,190 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 20:09:35,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1727604301, now seen corresponding path program 1 times [2018-02-02 20:09:35,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:09:35,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,256 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 20:09:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:09:35,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:09:35,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:09:35,256 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 7 states. [2018-02-02 20:09:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,371 INFO L93 Difference]: Finished difference Result 249 states and 278 transitions. [2018-02-02 20:09:35,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:09:35,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 20:09:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,372 INFO L225 Difference]: With dead ends: 249 [2018-02-02 20:09:35,372 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 20:09:35,373 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 20:09:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 20:09:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2018-02-02 20:09:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 20:09:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2018-02-02 20:09:35,377 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 18 [2018-02-02 20:09:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,377 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2018-02-02 20:09:35,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:09:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2018-02-02 20:09:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:09:35,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,378 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 20:09:35,378 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 20:09:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash 471570443, now seen corresponding path program 1 times [2018-02-02 20:09:35,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:09:35,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,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 20:09:35,417 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 20:09:35,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 20:09:35,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:35,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:35,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:35,418 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand 5 states. [2018-02-02 20:09:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,542 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2018-02-02 20:09:35,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:35,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 20:09:35,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,543 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:09:35,543 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:09:35,544 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 20:09:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:09:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-02-02 20:09:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:09:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2018-02-02 20:09:35,549 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 21 [2018-02-02 20:09:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,550 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2018-02-02 20:09:35,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2018-02-02 20:09:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:09:35,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,550 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 20:09:35,550 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 20:09:35,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1608607228, now seen corresponding path program 1 times [2018-02-02 20:09:35,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,575 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 20:09:35,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:35,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,576 INFO L182 omatonBuilderFactory]: Interpolants [2482#true, 2483#false, 2484#(not |main_#t~short6|)] [2018-02-02 20:09:35,576 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 20:09:35,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:09:35,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:09:35,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:09:35,576 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand 3 states. [2018-02-02 20:09:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,581 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-02 20:09:35,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:09:35,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-02 20:09:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,582 INFO L225 Difference]: With dead ends: 190 [2018-02-02 20:09:35,582 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 20:09:35,582 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 20:09:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 20:09:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-02-02 20:09:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 20:09:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2018-02-02 20:09:35,585 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 22 [2018-02-02 20:09:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,585 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2018-02-02 20:09:35,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:09:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2018-02-02 20:09:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:09:35,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,586 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 20:09:35,586 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 20:09:35,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1343010439, now seen corresponding path program 1 times [2018-02-02 20:09:35,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,702 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 20:09:35,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:09:35,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,703 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 20:09:35,704 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 20:09:35,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:09:35,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:09:35,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:09:35,704 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 6 states. [2018-02-02 20:09:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:35,866 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2018-02-02 20:09:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:09:35,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 20:09:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:35,868 INFO L225 Difference]: With dead ends: 238 [2018-02-02 20:09:35,868 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 20:09:35,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 20:09:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2018-02-02 20:09:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:09:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 237 transitions. [2018-02-02 20:09:35,872 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 237 transitions. Word has length 24 [2018-02-02 20:09:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:35,872 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 237 transitions. [2018-02-02 20:09:35,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:09:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 237 transitions. [2018-02-02 20:09:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:09:35,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:35,873 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 20:09:35,873 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 20:09:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174280, now seen corresponding path program 1 times [2018-02-02 20:09:35,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:35,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:35,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:35,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,907 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 20:09:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:35,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:35,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:35,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:35,908 INFO L87 Difference]: Start difference. First operand 206 states and 237 transitions. Second operand 5 states. [2018-02-02 20:09:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,114 INFO L93 Difference]: Finished difference Result 331 states and 382 transitions. [2018-02-02 20:09:36,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:36,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:09:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,115 INFO L225 Difference]: With dead ends: 331 [2018-02-02 20:09:36,116 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 20:09:36,116 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 20:09:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 20:09:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 205. [2018-02-02 20:09:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 20:09:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-02-02 20:09:36,121 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 25 [2018-02-02 20:09:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,121 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-02-02 20:09:36,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-02-02 20:09:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:09:36,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,122 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 20:09:36,122 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 20:09:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1202174281, now seen corresponding path program 1 times [2018-02-02 20:09:36,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:36,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:36,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:36,170 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 20:09:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:36,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:36,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:36,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:36,171 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-02-02 20:09:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,428 INFO L93 Difference]: Finished difference Result 364 states and 415 transitions. [2018-02-02 20:09:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:36,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:09:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,429 INFO L225 Difference]: With dead ends: 364 [2018-02-02 20:09:36,429 INFO L226 Difference]: Without dead ends: 364 [2018-02-02 20:09:36,429 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 20:09:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-02-02 20:09:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2018-02-02 20:09:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:09:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2018-02-02 20:09:36,434 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 25 [2018-02-02 20:09:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,434 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2018-02-02 20:09:36,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2018-02-02 20:09:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:09:36,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,435 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 20:09:36,435 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 20:09:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605704, now seen corresponding path program 1 times [2018-02-02 20:09:36,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,464 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 20:09:36,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:36,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:36,465 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 20:09:36,465 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 20:09:36,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:36,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:36,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:36,466 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand 4 states. [2018-02-02 20:09:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,597 INFO L93 Difference]: Finished difference Result 250 states and 283 transitions. [2018-02-02 20:09:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:36,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-02 20:09:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,601 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:09:36,601 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:09:36,601 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 20:09:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:09:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-02-02 20:09:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 20:09:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 238 transitions. [2018-02-02 20:09:36,605 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 238 transitions. Word has length 27 [2018-02-02 20:09:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,606 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 238 transitions. [2018-02-02 20:09:36,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 238 transitions. [2018-02-02 20:09:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:09:36,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,607 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 20:09:36,607 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 20:09:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2086605703, now seen corresponding path program 1 times [2018-02-02 20:09:36,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:36,737 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 20:09:36,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:36,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:09:36,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:36,738 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 20:09:36,738 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 20:09:36,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:09:36,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:09:36,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:36,739 INFO L87 Difference]: Start difference. First operand 207 states and 238 transitions. Second operand 8 states. [2018-02-02 20:09:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:36,987 INFO L93 Difference]: Finished difference Result 317 states and 353 transitions. [2018-02-02 20:09:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:09:36,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 20:09:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:36,988 INFO L225 Difference]: With dead ends: 317 [2018-02-02 20:09:36,988 INFO L226 Difference]: Without dead ends: 317 [2018-02-02 20:09:36,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:09:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-02 20:09:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 211. [2018-02-02 20:09:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:09:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 244 transitions. [2018-02-02 20:09:36,991 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 244 transitions. Word has length 27 [2018-02-02 20:09:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:36,991 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 244 transitions. [2018-02-02 20:09:36,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:09:36,992 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 244 transitions. [2018-02-02 20:09:36,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:09:36,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:36,992 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 20:09:36,992 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 20:09:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2086546122, now seen corresponding path program 1 times [2018-02-02 20:09:36,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:36,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:37,100 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 20:09:37,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:37,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:09:37,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:37,101 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 20:09:37,101 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 20:09:37,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:09:37,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:09:37,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:09:37,102 INFO L87 Difference]: Start difference. First operand 211 states and 244 transitions. Second operand 7 states. [2018-02-02 20:09:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:37,282 INFO L93 Difference]: Finished difference Result 343 states and 382 transitions. [2018-02-02 20:09:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:37,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 20:09:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:37,283 INFO L225 Difference]: With dead ends: 343 [2018-02-02 20:09:37,283 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 20:09:37,283 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 20:09:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 20:09:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2018-02-02 20:09:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:09:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 256 transitions. [2018-02-02 20:09:37,286 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 256 transitions. Word has length 27 [2018-02-02 20:09:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:37,286 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 256 transitions. [2018-02-02 20:09:37,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:09:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 256 transitions. [2018-02-02 20:09:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:09:37,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:37,287 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 20:09:37,287 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 20:09:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash -260268355, now seen corresponding path program 1 times [2018-02-02 20:09:37,288 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:37,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:37,327 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 20:09:37,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:37,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:09:37,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:37,328 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 20:09:37,328 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 20:09:37,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:09:37,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:09:37,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:09:37,329 INFO L87 Difference]: Start difference. First operand 223 states and 256 transitions. Second operand 8 states. [2018-02-02 20:09:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:37,483 INFO L93 Difference]: Finished difference Result 304 states and 341 transitions. [2018-02-02 20:09:37,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:37,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-02 20:09:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:37,484 INFO L225 Difference]: With dead ends: 304 [2018-02-02 20:09:37,484 INFO L226 Difference]: Without dead ends: 304 [2018-02-02 20:09:37,484 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 20:09:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-02 20:09:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 221. [2018-02-02 20:09:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 20:09:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2018-02-02 20:09:37,488 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 28 [2018-02-02 20:09:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:37,489 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2018-02-02 20:09:37,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:09:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2018-02-02 20:09:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:09:37,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:37,489 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 20:09:37,490 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 20:09:37,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248235, now seen corresponding path program 1 times [2018-02-02 20:09:37,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:37,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:37,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:37,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:37,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:37,556 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 20:09:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:37,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:37,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:37,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:37,556 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand 9 states. [2018-02-02 20:09:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:37,896 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2018-02-02 20:09:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:37,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 20:09:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:37,897 INFO L225 Difference]: With dead ends: 278 [2018-02-02 20:09:37,897 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 20:09:37,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 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 20:09:37,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 20:09:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 220. [2018-02-02 20:09:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 20:09:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-02-02 20:09:37,900 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 28 [2018-02-02 20:09:37,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:37,900 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-02-02 20:09:37,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-02-02 20:09:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:09:37,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:37,901 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 20:09:37,901 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 20:09:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1758248234, now seen corresponding path program 1 times [2018-02-02 20:09:37,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:37,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:38,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,022 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 20:09:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:38,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:38,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:38,023 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 9 states. [2018-02-02 20:09:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:38,486 INFO L93 Difference]: Finished difference Result 277 states and 316 transitions. [2018-02-02 20:09:38,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:38,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 20:09:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:38,487 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:09:38,488 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 20:09:38,488 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 20:09:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 20:09:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2018-02-02 20:09:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:09:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 249 transitions. [2018-02-02 20:09:38,492 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 249 transitions. Word has length 28 [2018-02-02 20:09:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:38,492 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 249 transitions. [2018-02-02 20:09:38,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 249 transitions. [2018-02-02 20:09:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:09:38,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:38,493 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 20:09:38,493 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 20:09:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776421, now seen corresponding path program 1 times [2018-02-02 20:09:38,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:38,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:38,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,526 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 20:09:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:38,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:38,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:38,527 INFO L87 Difference]: Start difference. First operand 219 states and 249 transitions. Second operand 5 states. [2018-02-02 20:09:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:38,694 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2018-02-02 20:09:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:38,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:09:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:38,695 INFO L225 Difference]: With dead ends: 347 [2018-02-02 20:09:38,695 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 20:09:38,695 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 20:09:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 20:09:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 218. [2018-02-02 20:09:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:09:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-02-02 20:09:38,697 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 29 [2018-02-02 20:09:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:38,697 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-02-02 20:09:38,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-02-02 20:09:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:09:38,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:38,698 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 20:09:38,698 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 20:09:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1399776422, now seen corresponding path program 1 times [2018-02-02 20:09:38,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:38,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:38,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:38,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,773 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 20:09:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:38,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:38,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:38,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:38,773 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 5 states. [2018-02-02 20:09:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,004 INFO L93 Difference]: Finished difference Result 380 states and 431 transitions. [2018-02-02 20:09:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:39,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:09:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,005 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:09:39,005 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:09:39,005 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 20:09:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:09:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 217. [2018-02-02 20:09:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 20:09:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-02-02 20:09:39,013 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 29 [2018-02-02 20:09:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,013 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-02-02 20:09:39,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-02-02 20:09:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:09:39,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,014 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 20:09:39,014 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 20:09:39,015 INFO L82 PathProgramCache]: Analyzing trace with hash 901972539, now seen corresponding path program 1 times [2018-02-02 20:09:39,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:39,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:39,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,116 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 20:09:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:39,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:39,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:39,116 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 9 states. [2018-02-02 20:09:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,536 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2018-02-02 20:09:39,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:39,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 20:09:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,537 INFO L225 Difference]: With dead ends: 244 [2018-02-02 20:09:39,538 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 20:09:39,538 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 20:09:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 20:09:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 216. [2018-02-02 20:09:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 20:09:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 244 transitions. [2018-02-02 20:09:39,541 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 244 transitions. Word has length 32 [2018-02-02 20:09:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,542 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 244 transitions. [2018-02-02 20:09:39,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 244 transitions. [2018-02-02 20:09:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:09:39,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,542 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 20:09:39,542 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 20:09:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash 901972538, now seen corresponding path program 1 times [2018-02-02 20:09:39,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:39,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:09:39,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,612 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 20:09:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:39,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:09:39,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:09:39,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:09:39,613 INFO L87 Difference]: Start difference. First operand 216 states and 244 transitions. Second operand 9 states. [2018-02-02 20:09:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:39,974 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2018-02-02 20:09:39,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:09:39,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 20:09:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:39,975 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:09:39,975 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:09:39,976 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 20:09:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:09:39,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2018-02-02 20:09:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:09:39,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 243 transitions. [2018-02-02 20:09:39,978 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 243 transitions. Word has length 32 [2018-02-02 20:09:39,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:39,978 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 243 transitions. [2018-02-02 20:09:39,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:09:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 243 transitions. [2018-02-02 20:09:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:09:39,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:39,978 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 20:09:39,978 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 20:09:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1252448966, now seen corresponding path program 1 times [2018-02-02 20:09:39,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:39,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,121 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 20:09:40,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:40,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:09:40,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,122 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 20:09:40,122 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 20:09:40,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:09:40,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:09:40,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:09:40,123 INFO L87 Difference]: Start difference. First operand 215 states and 243 transitions. Second operand 10 states. [2018-02-02 20:09:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:40,436 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2018-02-02 20:09:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:09:40,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-02-02 20:09:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:40,437 INFO L225 Difference]: With dead ends: 270 [2018-02-02 20:09:40,437 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 20:09:40,437 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 20:09:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 20:09:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2018-02-02 20:09:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 20:09:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 253 transitions. [2018-02-02 20:09:40,439 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 253 transitions. Word has length 37 [2018-02-02 20:09:40,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:40,439 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 253 transitions. [2018-02-02 20:09:40,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:09:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 253 transitions. [2018-02-02 20:09:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:09:40,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:40,440 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 20:09:40,440 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 20:09:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash 126757974, now seen corresponding path program 2 times [2018-02-02 20:09:40,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:40,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:40,650 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 20:09:40,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:40,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:09:40,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:40,651 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 20:09:40,651 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 20:09:40,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:40,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:40,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:40,652 INFO L87 Difference]: Start difference. First operand 225 states and 253 transitions. Second operand 14 states. [2018-02-02 20:09:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:41,179 INFO L93 Difference]: Finished difference Result 361 states and 400 transitions. [2018-02-02 20:09:41,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:09:41,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 20:09:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:41,181 INFO L225 Difference]: With dead ends: 361 [2018-02-02 20:09:41,181 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:09:41,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:09:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:09:41,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 257. [2018-02-02 20:09:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-02 20:09:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2018-02-02 20:09:41,184 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 47 [2018-02-02 20:09:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:41,185 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2018-02-02 20:09:41,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2018-02-02 20:09:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:41,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:41,185 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 20:09:41,185 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 20:09:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash -365471073, now seen corresponding path program 1 times [2018-02-02 20:09:41,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:41,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:41,234 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 20:09:41,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:41,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:09:41,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:41,235 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 20:09:41,235 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 20:09:41,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:41,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:41,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:41,236 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand 4 states. [2018-02-02 20:09:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:41,324 INFO L93 Difference]: Finished difference Result 344 states and 380 transitions. [2018-02-02 20:09:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:41,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-02-02 20:09:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:41,325 INFO L225 Difference]: With dead ends: 344 [2018-02-02 20:09:41,325 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 20:09:41,326 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 20:09:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 20:09:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 260. [2018-02-02 20:09:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 20:09:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 292 transitions. [2018-02-02 20:09:41,329 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 292 transitions. Word has length 48 [2018-02-02 20:09:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:41,329 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 292 transitions. [2018-02-02 20:09:41,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 292 transitions. [2018-02-02 20:09:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:41,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:41,330 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 20:09:41,330 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 20:09:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1428269570, now seen corresponding path program 1 times [2018-02-02 20:09:41,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:41,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:41,693 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 20:09:41,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:41,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:09:41,693 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:41,694 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 20:09:41,694 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 20:09:41,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:09:41,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:09:41,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:09:41,694 INFO L87 Difference]: Start difference. First operand 260 states and 292 transitions. Second operand 19 states. [2018-02-02 20:09:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:42,440 INFO L93 Difference]: Finished difference Result 350 states and 394 transitions. [2018-02-02 20:09:42,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:09:42,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 20:09:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:42,441 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:09:42,441 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:09:42,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:09:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:09:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 283. [2018-02-02 20:09:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 20:09:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 319 transitions. [2018-02-02 20:09:42,443 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 319 transitions. Word has length 48 [2018-02-02 20:09:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:42,444 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 319 transitions. [2018-02-02 20:09:42,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:09:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 319 transitions. [2018-02-02 20:09:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:42,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:42,444 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 20:09:42,444 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 20:09:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211522, now seen corresponding path program 1 times [2018-02-02 20:09:42,445 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:42,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:42,536 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 20:09:42,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:42,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:09:42,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:42,536 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 20:09:42,536 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 20:09:42,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:42,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:42,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:42,537 INFO L87 Difference]: Start difference. First operand 283 states and 319 transitions. Second operand 13 states. [2018-02-02 20:09:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:43,088 INFO L93 Difference]: Finished difference Result 535 states and 621 transitions. [2018-02-02 20:09:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:09:43,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 20:09:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:43,089 INFO L225 Difference]: With dead ends: 535 [2018-02-02 20:09:43,089 INFO L226 Difference]: Without dead ends: 535 [2018-02-02 20:09:43,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:09:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-02-02 20:09:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 328. [2018-02-02 20:09:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 20:09:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 387 transitions. [2018-02-02 20:09:43,093 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 387 transitions. Word has length 48 [2018-02-02 20:09:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:43,093 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 387 transitions. [2018-02-02 20:09:43,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 387 transitions. [2018-02-02 20:09:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:43,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:43,094 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 20:09:43,094 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 20:09:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1743211521, now seen corresponding path program 1 times [2018-02-02 20:09:43,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:43,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:43,249 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 20:09:43,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:43,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:09:43,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:43,250 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 20:09:43,250 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 20:09:43,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:09:43,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:09:43,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:09:43,250 INFO L87 Difference]: Start difference. First operand 328 states and 387 transitions. Second operand 13 states. [2018-02-02 20:09:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:43,974 INFO L93 Difference]: Finished difference Result 585 states and 682 transitions. [2018-02-02 20:09:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:09:44,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 20:09:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:44,006 INFO L225 Difference]: With dead ends: 585 [2018-02-02 20:09:44,006 INFO L226 Difference]: Without dead ends: 585 [2018-02-02 20:09:44,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:09:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-02-02 20:09:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 348. [2018-02-02 20:09:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 20:09:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 411 transitions. [2018-02-02 20:09:44,009 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 411 transitions. Word has length 48 [2018-02-02 20:09:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:44,009 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 411 transitions. [2018-02-02 20:09:44,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:09:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 411 transitions. [2018-02-02 20:09:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:09:44,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:44,010 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 20:09:44,010 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 20:09:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1737485884, now seen corresponding path program 1 times [2018-02-02 20:09:44,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:44,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:44,155 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 20:09:44,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:44,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:09:44,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09: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 20:09:44,156 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 20:09:44,156 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 20:09:44,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:09:44,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:09:44,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:09:44,156 INFO L87 Difference]: Start difference. First operand 348 states and 411 transitions. Second operand 11 states. [2018-02-02 20:09:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:44,700 INFO L93 Difference]: Finished difference Result 460 states and 551 transitions. [2018-02-02 20:09:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:09:44,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 20:09:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:44,701 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:09:44,701 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:09:44,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:09:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:09:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 396. [2018-02-02 20:09:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-02-02 20:09:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 472 transitions. [2018-02-02 20:09:44,704 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 472 transitions. Word has length 48 [2018-02-02 20:09:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:44,705 INFO L432 AbstractCegarLoop]: Abstraction has 396 states and 472 transitions. [2018-02-02 20:09:44,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:09:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 472 transitions. [2018-02-02 20:09:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:09:44,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:44,705 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 20:09:44,706 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 20:09:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1693063, now seen corresponding path program 1 times [2018-02-02 20:09:44,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:44,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:44,731 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 20:09:44,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:44,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:44,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:44,732 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 20:09:44,732 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 20:09:44,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:44,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:44,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:44,733 INFO L87 Difference]: Start difference. First operand 396 states and 472 transitions. Second operand 4 states. [2018-02-02 20:09:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:44,818 INFO L93 Difference]: Finished difference Result 408 states and 485 transitions. [2018-02-02 20:09:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 20:09:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:44,819 INFO L225 Difference]: With dead ends: 408 [2018-02-02 20:09:44,820 INFO L226 Difference]: Without dead ends: 408 [2018-02-02 20:09:44,820 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 20:09:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-02 20:09:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 397. [2018-02-02 20:09:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-02-02 20:09:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 475 transitions. [2018-02-02 20:09:44,825 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 475 transitions. Word has length 51 [2018-02-02 20:09:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:44,825 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 475 transitions. [2018-02-02 20:09:44,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 475 transitions. [2018-02-02 20:09:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:09:44,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:44,826 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 20:09:44,826 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 20:09:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1693062, now seen corresponding path program 1 times [2018-02-02 20:09:44,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:44,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:44,872 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 20:09:44,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:44,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:44,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:44,873 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 20:09:44,873 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 20:09:44,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:44,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:44,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:44,874 INFO L87 Difference]: Start difference. First operand 397 states and 475 transitions. Second operand 4 states. [2018-02-02 20:09:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:44,943 INFO L93 Difference]: Finished difference Result 401 states and 477 transitions. [2018-02-02 20:09:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:44,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 20:09:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:44,944 INFO L225 Difference]: With dead ends: 401 [2018-02-02 20:09:44,944 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 20:09:44,944 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 20:09:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 20:09:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2018-02-02 20:09:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 20:09:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 472 transitions. [2018-02-02 20:09:44,947 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 472 transitions. Word has length 51 [2018-02-02 20:09:44,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:44,948 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 472 transitions. [2018-02-02 20:09:44,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 472 transitions. [2018-02-02 20:09:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:09:44,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:44,948 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 20:09:44,948 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 20:09:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash 579321489, now seen corresponding path program 1 times [2018-02-02 20:09:44,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:44,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:45,137 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 20:09:45,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:45,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:09:45,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:45,137 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 20:09:45,138 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 20:09:45,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:09:45,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:09:45,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:09:45,138 INFO L87 Difference]: Start difference. First operand 395 states and 472 transitions. Second operand 16 states. [2018-02-02 20:09:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:45,660 INFO L93 Difference]: Finished difference Result 500 states and 591 transitions. [2018-02-02 20:09:45,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:09:45,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-02-02 20:09:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:45,661 INFO L225 Difference]: With dead ends: 500 [2018-02-02 20:09:45,661 INFO L226 Difference]: Without dead ends: 500 [2018-02-02 20:09:45,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:09:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-02-02 20:09:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 407. [2018-02-02 20:09:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-02-02 20:09:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 484 transitions. [2018-02-02 20:09:45,664 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 484 transitions. Word has length 51 [2018-02-02 20:09:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:45,664 INFO L432 AbstractCegarLoop]: Abstraction has 407 states and 484 transitions. [2018-02-02 20:09:45,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:09:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 484 transitions. [2018-02-02 20:09:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:09:45,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:45,665 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 20:09:45,665 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 20:09:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1647796079, now seen corresponding path program 1 times [2018-02-02 20:09:45,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:45,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:45,943 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 20:09:45,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:45,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:09:45,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:45,943 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 20:09:45,943 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 20:09:45,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:09:45,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:09:45,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:09:45,944 INFO L87 Difference]: Start difference. First operand 407 states and 484 transitions. Second operand 17 states. [2018-02-02 20:09:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:46,845 INFO L93 Difference]: Finished difference Result 795 states and 937 transitions. [2018-02-02 20:09:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:09:46,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-02 20:09:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:46,846 INFO L225 Difference]: With dead ends: 795 [2018-02-02 20:09:46,846 INFO L226 Difference]: Without dead ends: 795 [2018-02-02 20:09:46,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:09:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-02-02 20:09:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 439. [2018-02-02 20:09:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 20:09:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 524 transitions. [2018-02-02 20:09:46,850 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 524 transitions. Word has length 51 [2018-02-02 20:09:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:46,850 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 524 transitions. [2018-02-02 20:09:46,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:09:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 524 transitions. [2018-02-02 20:09:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:09:46,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:46,851 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 20:09:46,851 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 20:09:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1647796078, now seen corresponding path program 1 times [2018-02-02 20:09:46,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:46,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:47,117 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 20:09:47,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:47,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:09:47,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:47,118 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 20:09:47,118 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 20:09:47,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:09:47,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:09:47,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:09:47,119 INFO L87 Difference]: Start difference. First operand 439 states and 524 transitions. Second operand 17 states. [2018-02-02 20:09:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:48,324 INFO L93 Difference]: Finished difference Result 846 states and 991 transitions. [2018-02-02 20:09:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:09:48,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-02-02 20:09:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:48,326 INFO L225 Difference]: With dead ends: 846 [2018-02-02 20:09:48,326 INFO L226 Difference]: Without dead ends: 846 [2018-02-02 20:09:48,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:09:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-02-02 20:09:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 445. [2018-02-02 20:09:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-02-02 20:09:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 530 transitions. [2018-02-02 20:09:48,330 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 530 transitions. Word has length 51 [2018-02-02 20:09:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:48,330 INFO L432 AbstractCegarLoop]: Abstraction has 445 states and 530 transitions. [2018-02-02 20:09:48,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:09:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 530 transitions. [2018-02-02 20:09:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:09:48,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:48,331 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 20:09:48,331 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 20:09:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1619324790, now seen corresponding path program 1 times [2018-02-02 20:09:48,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:48,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:48,552 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 20:09:48,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:48,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:09:48,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:48,553 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 20:09:48,553 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 20:09:48,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:09:48,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:09:48,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:09:48,553 INFO L87 Difference]: Start difference. First operand 445 states and 530 transitions. Second operand 17 states. [2018-02-02 20:09:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:49,610 INFO L93 Difference]: Finished difference Result 1062 states and 1280 transitions. [2018-02-02 20:09:49,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:09:49,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 20:09:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:49,612 INFO L225 Difference]: With dead ends: 1062 [2018-02-02 20:09:49,612 INFO L226 Difference]: Without dead ends: 1062 [2018-02-02 20:09:49,613 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 20:09:49,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-02-02 20:09:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 517. [2018-02-02 20:09:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-02-02 20:09:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2018-02-02 20:09:49,619 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 56 [2018-02-02 20:09:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:49,619 INFO L432 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2018-02-02 20:09:49,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:09:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2018-02-02 20:09:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:09:49,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:49,620 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 20:09:49,620 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 20:09:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1619324789, now seen corresponding path program 1 times [2018-02-02 20:09:49,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:49,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:50,029 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 20:09:50,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:50,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:09:50,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:50,030 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 20:09:50,030 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 20:09:50,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:09:50,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:09:50,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:09:50,030 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand 18 states. [2018-02-02 20:09:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:51,713 INFO L93 Difference]: Finished difference Result 1119 states and 1349 transitions. [2018-02-02 20:09:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:09:51,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-02-02 20:09:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:51,715 INFO L225 Difference]: With dead ends: 1119 [2018-02-02 20:09:51,716 INFO L226 Difference]: Without dead ends: 1119 [2018-02-02 20:09:51,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=519, Invalid=1737, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:09:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-02-02 20:09:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 533. [2018-02-02 20:09:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-02-02 20:09:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 654 transitions. [2018-02-02 20:09:51,721 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 654 transitions. Word has length 56 [2018-02-02 20:09:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:51,721 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 654 transitions. [2018-02-02 20:09:51,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:09:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 654 transitions. [2018-02-02 20:09:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:09:51,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:51,722 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 20:09:51,722 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 20:09:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1613599152, now seen corresponding path program 1 times [2018-02-02 20:09:51,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:51,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:51,944 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 20:09:51,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:51,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:51,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:51,945 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 20:09:51,945 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 20:09:51,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:51,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:51,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:51,946 INFO L87 Difference]: Start difference. First operand 533 states and 654 transitions. Second operand 14 states. [2018-02-02 20:09:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:52,492 INFO L93 Difference]: Finished difference Result 1002 states and 1223 transitions. [2018-02-02 20:09:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:09:52,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 20:09:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:52,495 INFO L225 Difference]: With dead ends: 1002 [2018-02-02 20:09:52,495 INFO L226 Difference]: Without dead ends: 1002 [2018-02-02 20:09:52,496 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 20:09:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-02-02 20:09:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 591. [2018-02-02 20:09:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-02 20:09:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 737 transitions. [2018-02-02 20:09:52,503 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 737 transitions. Word has length 56 [2018-02-02 20:09:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:52,503 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 737 transitions. [2018-02-02 20:09:52,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 737 transitions. [2018-02-02 20:09:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:09:52,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:52,504 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 20:09:52,504 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 20:09:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1613599151, now seen corresponding path program 1 times [2018-02-02 20:09:52,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:52,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:52,784 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 20:09:52,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:52,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:09:52,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:52,785 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 20:09:52,786 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 20:09:52,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:09:52,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:09:52,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:09:52,786 INFO L87 Difference]: Start difference. First operand 591 states and 737 transitions. Second operand 14 states. [2018-02-02 20:09:53,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:53,585 INFO L93 Difference]: Finished difference Result 1074 states and 1313 transitions. [2018-02-02 20:09:53,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:09:53,585 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 20:09:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:53,587 INFO L225 Difference]: With dead ends: 1074 [2018-02-02 20:09:53,587 INFO L226 Difference]: Without dead ends: 1074 [2018-02-02 20:09:53,587 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 20:09:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2018-02-02 20:09:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 605. [2018-02-02 20:09:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-02-02 20:09:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 756 transitions. [2018-02-02 20:09:53,592 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 756 transitions. Word has length 56 [2018-02-02 20:09:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:53,592 INFO L432 AbstractCegarLoop]: Abstraction has 605 states and 756 transitions. [2018-02-02 20:09:53,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:09:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 756 transitions. [2018-02-02 20:09:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:09:53,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:53,592 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 20:09:53,592 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 20:09:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash 753453542, now seen corresponding path program 3 times [2018-02-02 20:09:53,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:53,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:53,757 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 20:09:53,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:53,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:09:53,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:53,758 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 20:09:53,758 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 20:09:53,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:09:53,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:09:53,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:09:53,759 INFO L87 Difference]: Start difference. First operand 605 states and 756 transitions. Second operand 15 states. [2018-02-02 20:09:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:54,216 INFO L93 Difference]: Finished difference Result 680 states and 833 transitions. [2018-02-02 20:09:54,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:09:54,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-02 20:09:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:54,250 INFO L225 Difference]: With dead ends: 680 [2018-02-02 20:09:54,250 INFO L226 Difference]: Without dead ends: 680 [2018-02-02 20:09:54,251 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 20:09:54,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-02-02 20:09:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 595. [2018-02-02 20:09:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-02-02 20:09:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 744 transitions. [2018-02-02 20:09:54,254 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 744 transitions. Word has length 57 [2018-02-02 20:09:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:54,254 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 744 transitions. [2018-02-02 20:09:54,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:09:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 744 transitions. [2018-02-02 20:09:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:09:54,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:54,255 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 20:09:54,255 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 20:09:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -685645087, now seen corresponding path program 1 times [2018-02-02 20:09:54,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:54,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:54,280 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 20:09:54,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:54,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:09:54,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,281 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 20:09:54,281 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 20:09:54,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:54,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:54,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:54,282 INFO L87 Difference]: Start difference. First operand 595 states and 744 transitions. Second operand 4 states. [2018-02-02 20:09:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:54,372 INFO L93 Difference]: Finished difference Result 612 states and 762 transitions. [2018-02-02 20:09:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:09:54,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-02-02 20:09:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:54,374 INFO L225 Difference]: With dead ends: 612 [2018-02-02 20:09:54,374 INFO L226 Difference]: Without dead ends: 612 [2018-02-02 20:09:54,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 20:09:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-02-02 20:09:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 594. [2018-02-02 20:09:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-02-02 20:09:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 744 transitions. [2018-02-02 20:09:54,380 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 744 transitions. Word has length 57 [2018-02-02 20:09:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:54,380 INFO L432 AbstractCegarLoop]: Abstraction has 594 states and 744 transitions. [2018-02-02 20:09:54,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 744 transitions. [2018-02-02 20:09:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:09:54,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:54,381 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 20:09:54,381 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 20:09:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash -685645086, now seen corresponding path program 1 times [2018-02-02 20:09:54,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:54,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:54,434 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 20:09:54,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:54,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:54,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,435 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 20:09:54,435 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 20:09:54,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:09:54,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:09:54,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:09:54,435 INFO L87 Difference]: Start difference. First operand 594 states and 744 transitions. Second operand 5 states. [2018-02-02 20:09:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:54,579 INFO L93 Difference]: Finished difference Result 621 states and 771 transitions. [2018-02-02 20:09:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:09:54,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-02-02 20:09:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:54,580 INFO L225 Difference]: With dead ends: 621 [2018-02-02 20:09:54,580 INFO L226 Difference]: Without dead ends: 621 [2018-02-02 20:09:54,581 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 20:09:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-02-02 20:09:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 596. [2018-02-02 20:09:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 20:09:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 745 transitions. [2018-02-02 20:09:54,584 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 745 transitions. Word has length 57 [2018-02-02 20:09:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:54,585 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 745 transitions. [2018-02-02 20:09:54,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:09:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 745 transitions. [2018-02-02 20:09:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:09:54,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:54,585 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 20:09:54,585 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 20:09:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash 219806186, now seen corresponding path program 1 times [2018-02-02 20:09:54,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:54,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:54,606 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 20:09:54,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:09:54,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:09:54,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,606 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 20:09:54,606 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 20:09:54,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:09:54,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:09:54,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:09:54,607 INFO L87 Difference]: Start difference. First operand 596 states and 745 transitions. Second operand 4 states. [2018-02-02 20:09:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:54,620 INFO L93 Difference]: Finished difference Result 596 states and 744 transitions. [2018-02-02 20:09:54,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:09:54,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-02-02 20:09:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:54,623 INFO L225 Difference]: With dead ends: 596 [2018-02-02 20:09:54,623 INFO L226 Difference]: Without dead ends: 596 [2018-02-02 20:09:54,623 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 20:09:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-02-02 20:09:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2018-02-02 20:09:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-02-02 20:09:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 744 transitions. [2018-02-02 20:09:54,630 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 744 transitions. Word has length 58 [2018-02-02 20:09:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:54,630 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 744 transitions. [2018-02-02 20:09:54,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:09:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 744 transitions. [2018-02-02 20:09:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:09:54,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:54,632 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 20:09:54,632 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 20:09:54,633 INFO L82 PathProgramCache]: Analyzing trace with hash -315070331, now seen corresponding path program 1 times [2018-02-02 20:09:54,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:54,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:54,995 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 20:09:54,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:54,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:09:54,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:54,996 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 20:09:54,996 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 20:09:54,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:09:54,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:09:54,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:09:54,997 INFO L87 Difference]: Start difference. First operand 596 states and 744 transitions. Second operand 20 states. [2018-02-02 20:09:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:56,664 INFO L93 Difference]: Finished difference Result 1157 states and 1411 transitions. [2018-02-02 20:09:56,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 20:09:56,664 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-02-02 20:09:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:56,666 INFO L225 Difference]: With dead ends: 1157 [2018-02-02 20:09:56,666 INFO L226 Difference]: Without dead ends: 1157 [2018-02-02 20:09:56,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:09:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2018-02-02 20:09:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 610. [2018-02-02 20:09:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-02-02 20:09:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 760 transitions. [2018-02-02 20:09:56,671 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 760 transitions. Word has length 59 [2018-02-02 20:09:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:56,671 INFO L432 AbstractCegarLoop]: Abstraction has 610 states and 760 transitions. [2018-02-02 20:09:56,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:09:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 760 transitions. [2018-02-02 20:09:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:09:56,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:56,672 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 20:09:56,672 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 20:09:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -315070330, now seen corresponding path program 1 times [2018-02-02 20:09:56,672 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:56,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:57,015 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 20:09:57,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:57,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:09:57,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:57,016 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 20:09:57,016 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 20:09:57,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:09:57,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:09:57,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:09:57,017 INFO L87 Difference]: Start difference. First operand 610 states and 760 transitions. Second operand 21 states. [2018-02-02 20:09:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:59,053 INFO L93 Difference]: Finished difference Result 1205 states and 1462 transitions. [2018-02-02 20:09:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:09:59,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-02-02 20:09:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:59,055 INFO L225 Difference]: With dead ends: 1205 [2018-02-02 20:09:59,055 INFO L226 Difference]: Without dead ends: 1205 [2018-02-02 20:09:59,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=687, Invalid=2853, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:09:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-02-02 20:09:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 578. [2018-02-02 20:09:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-02-02 20:09:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2018-02-02 20:09:59,060 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 59 [2018-02-02 20:09:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:59,060 INFO L432 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2018-02-02 20:09:59,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:09:59,060 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2018-02-02 20:09:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:09:59,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:59,060 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 20:09:59,060 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 20:09:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 811848755, now seen corresponding path program 1 times [2018-02-02 20:09:59,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:59,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:09:59,231 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 20:09:59,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:09:59,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:09:59,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:09:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:09:59,232 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 20:09:59,232 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 20:09:59,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:09:59,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:09:59,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:09:59,232 INFO L87 Difference]: Start difference. First operand 578 states and 720 transitions. Second operand 15 states. [2018-02-02 20:09:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:09:59,737 INFO L93 Difference]: Finished difference Result 629 states and 778 transitions. [2018-02-02 20:09:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:09:59,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-02-02 20:09:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:09:59,739 INFO L225 Difference]: With dead ends: 629 [2018-02-02 20:09:59,739 INFO L226 Difference]: Without dead ends: 629 [2018-02-02 20:09:59,739 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 20:09:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-02 20:09:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 579. [2018-02-02 20:09:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-02-02 20:09:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 722 transitions. [2018-02-02 20:09:59,742 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 722 transitions. Word has length 60 [2018-02-02 20:09:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:09:59,743 INFO L432 AbstractCegarLoop]: Abstraction has 579 states and 722 transitions. [2018-02-02 20:09:59,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:09:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 722 transitions. [2018-02-02 20:09:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:09:59,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:09:59,743 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 20:09:59,743 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 20:09:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash 811848756, now seen corresponding path program 1 times [2018-02-02 20:09:59,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:09:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:09:59,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:00,019 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 20:10:00,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:00,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:10:00,019 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:00,020 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 20:10:00,020 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 20:10:00,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:10:00,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:10:00,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:10:00,020 INFO L87 Difference]: Start difference. First operand 579 states and 722 transitions. Second operand 17 states. [2018-02-02 20:10:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:00,690 INFO L93 Difference]: Finished difference Result 667 states and 817 transitions. [2018-02-02 20:10:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:10:00,690 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-02-02 20:10:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:00,692 INFO L225 Difference]: With dead ends: 667 [2018-02-02 20:10:00,692 INFO L226 Difference]: Without dead ends: 667 [2018-02-02 20:10:00,692 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 20:10:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-02-02 20:10:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 595. [2018-02-02 20:10:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-02-02 20:10:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 745 transitions. [2018-02-02 20:10:00,695 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 745 transitions. Word has length 60 [2018-02-02 20:10:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:00,695 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 745 transitions. [2018-02-02 20:10:00,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:10:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 745 transitions. [2018-02-02 20:10:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:00,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:00,696 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 20:10:00,696 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 20:10:00,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1665732193, now seen corresponding path program 1 times [2018-02-02 20:10:00,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:00,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:01,210 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 20:10:01,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:01,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:10:01,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:01,211 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 20:10:01,211 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 20:10:01,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:10:01,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:10:01,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:10:01,212 INFO L87 Difference]: Start difference. First operand 595 states and 745 transitions. Second operand 22 states. [2018-02-02 20:10:01,949 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-02-02 20:10:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:03,396 INFO L93 Difference]: Finished difference Result 1120 states and 1358 transitions. [2018-02-02 20:10:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:10:03,396 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-02-02 20:10:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:03,399 INFO L225 Difference]: With dead ends: 1120 [2018-02-02 20:10:03,399 INFO L226 Difference]: Without dead ends: 1120 [2018-02-02 20:10:03,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=2936, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:10:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-02-02 20:10:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 711. [2018-02-02 20:10:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-02-02 20:10:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 887 transitions. [2018-02-02 20:10:03,404 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 887 transitions. Word has length 61 [2018-02-02 20:10:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:03,404 INFO L432 AbstractCegarLoop]: Abstraction has 711 states and 887 transitions. [2018-02-02 20:10:03,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:10:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 887 transitions. [2018-02-02 20:10:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:03,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:03,405 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 20:10:03,405 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 20:10:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1665732194, now seen corresponding path program 1 times [2018-02-02 20:10:03,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:03,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:04,023 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 20:10:04,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:04,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:10:04,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:04,024 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 20:10:04,024 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 20:10:04,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:10:04,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:10:04,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:10:04,025 INFO L87 Difference]: Start difference. First operand 711 states and 887 transitions. Second operand 21 states. [2018-02-02 20:10:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:05,863 INFO L93 Difference]: Finished difference Result 1150 states and 1399 transitions. [2018-02-02 20:10:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:10:05,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 20:10:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:05,865 INFO L225 Difference]: With dead ends: 1150 [2018-02-02 20:10:05,865 INFO L226 Difference]: Without dead ends: 1150 [2018-02-02 20:10:05,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=490, Invalid=2266, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:10:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-02-02 20:10:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 709. [2018-02-02 20:10:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-02-02 20:10:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 884 transitions. [2018-02-02 20:10:05,871 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 884 transitions. Word has length 61 [2018-02-02 20:10:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:05,871 INFO L432 AbstractCegarLoop]: Abstraction has 709 states and 884 transitions. [2018-02-02 20:10:05,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:10:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 884 transitions. [2018-02-02 20:10:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:05,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:05,871 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 20:10:05,871 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 20:10:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1269338015, now seen corresponding path program 1 times [2018-02-02 20:10:05,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:05,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:05,947 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 20:10:05,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:05,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:10:05,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:05,948 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 20:10:05,948 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 20:10:05,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:10:05,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:10:05,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:10:05,948 INFO L87 Difference]: Start difference. First operand 709 states and 884 transitions. Second operand 13 states. [2018-02-02 20:10:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:06,582 INFO L93 Difference]: Finished difference Result 1118 states and 1358 transitions. [2018-02-02 20:10:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:10:06,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-02 20:10:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:06,584 INFO L225 Difference]: With dead ends: 1118 [2018-02-02 20:10:06,584 INFO L226 Difference]: Without dead ends: 1095 [2018-02-02 20:10:06,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:10:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-02-02 20:10:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 741. [2018-02-02 20:10:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-02-02 20:10:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 923 transitions. [2018-02-02 20:10:06,590 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 923 transitions. Word has length 61 [2018-02-02 20:10:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:06,590 INFO L432 AbstractCegarLoop]: Abstraction has 741 states and 923 transitions. [2018-02-02 20:10:06,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:10:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 923 transitions. [2018-02-02 20:10:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:06,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:06,591 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 20:10:06,591 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 20:10:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2014452450, now seen corresponding path program 1 times [2018-02-02 20:10:06,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:06,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:06,632 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 20:10:06,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:06,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:06,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:06,633 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 20:10:06,633 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 20:10:06,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:06,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:06,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:06,633 INFO L87 Difference]: Start difference. First operand 741 states and 923 transitions. Second operand 5 states. [2018-02-02 20:10:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:06,739 INFO L93 Difference]: Finished difference Result 793 states and 983 transitions. [2018-02-02 20:10:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:10:06,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-02-02 20:10:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:06,740 INFO L225 Difference]: With dead ends: 793 [2018-02-02 20:10:06,740 INFO L226 Difference]: Without dead ends: 793 [2018-02-02 20:10:06,741 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 20:10:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-02-02 20:10:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 735. [2018-02-02 20:10:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-02-02 20:10:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 914 transitions. [2018-02-02 20:10:06,746 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 914 transitions. Word has length 61 [2018-02-02 20:10:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:06,746 INFO L432 AbstractCegarLoop]: Abstraction has 735 states and 914 transitions. [2018-02-02 20:10:06,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 914 transitions. [2018-02-02 20:10:06,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:10:06,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:06,747 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 20:10:06,747 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 20:10:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2014512031, now seen corresponding path program 2 times [2018-02-02 20:10:06,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:06,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:07,233 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 20:10:07,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:07,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:10:07,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:07,233 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 20:10:07,234 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 20:10:07,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:10:07,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:10:07,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:10:07,235 INFO L87 Difference]: Start difference. First operand 735 states and 914 transitions. Second operand 20 states. [2018-02-02 20:10:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:08,811 INFO L93 Difference]: Finished difference Result 1104 states and 1342 transitions. [2018-02-02 20:10:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:10:08,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-02-02 20:10:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:08,813 INFO L225 Difference]: With dead ends: 1104 [2018-02-02 20:10:08,813 INFO L226 Difference]: Without dead ends: 1104 [2018-02-02 20:10:08,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:10:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2018-02-02 20:10:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 745. [2018-02-02 20:10:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-02-02 20:10:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 925 transitions. [2018-02-02 20:10:08,818 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 925 transitions. Word has length 61 [2018-02-02 20:10:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:08,819 INFO L432 AbstractCegarLoop]: Abstraction has 745 states and 925 transitions. [2018-02-02 20:10:08,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:10:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 925 transitions. [2018-02-02 20:10:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:10:08,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:08,819 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 20:10:08,819 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 20:10:08,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1976484492, now seen corresponding path program 1 times [2018-02-02 20:10:08,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:08,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:08,852 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 20:10:08,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:08,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:08,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:08,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 20:10:08,853 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 20:10:08,853 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 20:10:08,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:08,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:08,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:08,853 INFO L87 Difference]: Start difference. First operand 745 states and 925 transitions. Second operand 4 states. [2018-02-02 20:10:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:08,897 INFO L93 Difference]: Finished difference Result 752 states and 931 transitions. [2018-02-02 20:10:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:08,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-02-02 20:10:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:08,899 INFO L225 Difference]: With dead ends: 752 [2018-02-02 20:10:08,899 INFO L226 Difference]: Without dead ends: 752 [2018-02-02 20:10:08,899 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 20:10:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-02-02 20:10:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 745. [2018-02-02 20:10:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-02-02 20:10:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 924 transitions. [2018-02-02 20:10:08,903 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 924 transitions. Word has length 62 [2018-02-02 20:10:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:08,903 INFO L432 AbstractCegarLoop]: Abstraction has 745 states and 924 transitions. [2018-02-02 20:10:08,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 924 transitions. [2018-02-02 20:10:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:10:08,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:08,904 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 20:10:08,904 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 20:10:08,904 INFO L82 PathProgramCache]: Analyzing trace with hash -176167627, now seen corresponding path program 1 times [2018-02-02 20:10:08,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:08,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:08,929 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 20:10:08,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:08,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:08,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:08,930 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 20:10:08,930 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 20:10:08,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:08,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:08,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:08,930 INFO L87 Difference]: Start difference. First operand 745 states and 924 transitions. Second operand 4 states. [2018-02-02 20:10:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:09,003 INFO L93 Difference]: Finished difference Result 771 states and 954 transitions. [2018-02-02 20:10:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:09,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-02-02 20:10:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:09,005 INFO L225 Difference]: With dead ends: 771 [2018-02-02 20:10:09,005 INFO L226 Difference]: Without dead ends: 771 [2018-02-02 20:10:09,005 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 20:10:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-02-02 20:10:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 744. [2018-02-02 20:10:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-02-02 20:10:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 922 transitions. [2018-02-02 20:10:09,009 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 922 transitions. Word has length 64 [2018-02-02 20:10:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:09,009 INFO L432 AbstractCegarLoop]: Abstraction has 744 states and 922 transitions. [2018-02-02 20:10:09,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 922 transitions. [2018-02-02 20:10:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:10:09,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:09,010 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 20:10:09,010 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 20:10:09,010 INFO L82 PathProgramCache]: Analyzing trace with hash -176167626, now seen corresponding path program 1 times [2018-02-02 20:10:09,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:09,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:09,050 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 20:10:09,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:09,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:09,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:09,051 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 20:10:09,051 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 20:10:09,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:09,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:09,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:09,051 INFO L87 Difference]: Start difference. First operand 744 states and 922 transitions. Second operand 4 states. [2018-02-02 20:10:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:09,136 INFO L93 Difference]: Finished difference Result 803 states and 986 transitions. [2018-02-02 20:10:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:09,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-02-02 20:10:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:09,137 INFO L225 Difference]: With dead ends: 803 [2018-02-02 20:10:09,137 INFO L226 Difference]: Without dead ends: 803 [2018-02-02 20:10:09,138 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 20:10:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-02-02 20:10:09,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 742. [2018-02-02 20:10:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-02-02 20:10:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 918 transitions. [2018-02-02 20:10:09,144 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 918 transitions. Word has length 64 [2018-02-02 20:10:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:09,144 INFO L432 AbstractCegarLoop]: Abstraction has 742 states and 918 transitions. [2018-02-02 20:10:09,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 918 transitions. [2018-02-02 20:10:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:10:09,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:09,144 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 20:10:09,144 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 20:10:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1378113097, now seen corresponding path program 1 times [2018-02-02 20:10:09,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:09,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:09,170 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 20:10:09,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:09,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:09,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:09,171 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 20:10:09,171 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 20:10:09,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:09,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:09,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:09,171 INFO L87 Difference]: Start difference. First operand 742 states and 918 transitions. Second operand 4 states. [2018-02-02 20:10:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:09,229 INFO L93 Difference]: Finished difference Result 756 states and 933 transitions. [2018-02-02 20:10:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:09,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-02-02 20:10:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:09,230 INFO L225 Difference]: With dead ends: 756 [2018-02-02 20:10:09,230 INFO L226 Difference]: Without dead ends: 756 [2018-02-02 20:10:09,230 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 20:10:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2018-02-02 20:10:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 741. [2018-02-02 20:10:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-02-02 20:10:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 916 transitions. [2018-02-02 20:10:09,234 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 916 transitions. Word has length 66 [2018-02-02 20:10:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:09,234 INFO L432 AbstractCegarLoop]: Abstraction has 741 states and 916 transitions. [2018-02-02 20:10:09,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 916 transitions. [2018-02-02 20:10:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:10:09,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:09,235 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 20:10:09,235 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 20:10:09,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1378113096, now seen corresponding path program 1 times [2018-02-02 20:10:09,235 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:09,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:09,281 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 20:10:09,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:09,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:09,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:09,282 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 20:10:09,282 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 20:10:09,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:09,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:09,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:09,283 INFO L87 Difference]: Start difference. First operand 741 states and 916 transitions. Second operand 4 states. [2018-02-02 20:10:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:09,409 INFO L93 Difference]: Finished difference Result 783 states and 958 transitions. [2018-02-02 20:10:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:09,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-02-02 20:10:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:09,411 INFO L225 Difference]: With dead ends: 783 [2018-02-02 20:10:09,411 INFO L226 Difference]: Without dead ends: 783 [2018-02-02 20:10:09,411 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 20:10:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-02-02 20:10:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 739. [2018-02-02 20:10:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-02-02 20:10:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 912 transitions. [2018-02-02 20:10:09,417 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 912 transitions. Word has length 66 [2018-02-02 20:10:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:09,417 INFO L432 AbstractCegarLoop]: Abstraction has 739 states and 912 transitions. [2018-02-02 20:10:09,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 912 transitions. [2018-02-02 20:10:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:10:09,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:09,418 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 20:10:09,418 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 20:10:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2019706376, now seen corresponding path program 2 times [2018-02-02 20:10:09,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:09,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:09,829 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 20:10:09,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:09,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:10:09,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:09,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 20:10:09,830 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 20:10:09,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 20:10:09,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:10:09,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:10:09,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:10:09,830 INFO L87 Difference]: Start difference. First operand 739 states and 912 transitions. Second operand 20 states. [2018-02-02 20:10:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:11,146 INFO L93 Difference]: Finished difference Result 1279 states and 1573 transitions. [2018-02-02 20:10:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:10:11,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-02-02 20:10:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:11,148 INFO L225 Difference]: With dead ends: 1279 [2018-02-02 20:10:11,148 INFO L226 Difference]: Without dead ends: 1279 [2018-02-02 20:10:11,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=399, Invalid=1857, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:10:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-02-02 20:10:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 849. [2018-02-02 20:10:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-02-02 20:10:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1061 transitions. [2018-02-02 20:10:11,156 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1061 transitions. Word has length 66 [2018-02-02 20:10:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:11,156 INFO L432 AbstractCegarLoop]: Abstraction has 849 states and 1061 transitions. [2018-02-02 20:10:11,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:10:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1061 transitions. [2018-02-02 20:10:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:10:11,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:11,156 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 20:10:11,156 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 20:10:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2063132610, now seen corresponding path program 1 times [2018-02-02 20:10:11,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:11,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:11,626 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 20:10:11,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:11,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:10:11,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:11,699 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 20:10:11,699 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 20:10:11,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:10:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:10:11,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:10:11,699 INFO L87 Difference]: Start difference. First operand 849 states and 1061 transitions. Second operand 19 states. [2018-02-02 20:10:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:12,774 INFO L93 Difference]: Finished difference Result 1235 states and 1511 transitions. [2018-02-02 20:10:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:10:12,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-02 20:10:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:12,775 INFO L225 Difference]: With dead ends: 1235 [2018-02-02 20:10:12,775 INFO L226 Difference]: Without dead ends: 1235 [2018-02-02 20:10:12,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:10:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-02-02 20:10:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 817. [2018-02-02 20:10:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-02-02 20:10:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1011 transitions. [2018-02-02 20:10:12,782 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1011 transitions. Word has length 66 [2018-02-02 20:10:12,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:12,782 INFO L432 AbstractCegarLoop]: Abstraction has 817 states and 1011 transitions. [2018-02-02 20:10:12,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:10:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1011 transitions. [2018-02-02 20:10:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:10:12,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:12,783 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 20:10:12,783 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 20:10:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash 241497805, now seen corresponding path program 1 times [2018-02-02 20:10:12,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:12,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:12,833 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 20:10:12,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:12,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:10:12,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:12,834 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 20:10:12,834 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 20:10:12,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:12,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:12,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:12,835 INFO L87 Difference]: Start difference. First operand 817 states and 1011 transitions. Second operand 5 states. [2018-02-02 20:10:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:12,887 INFO L93 Difference]: Finished difference Result 828 states and 1023 transitions. [2018-02-02 20:10:12,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:12,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:10:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:12,888 INFO L225 Difference]: With dead ends: 828 [2018-02-02 20:10:12,888 INFO L226 Difference]: Without dead ends: 828 [2018-02-02 20:10:12,888 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 20:10:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-02-02 20:10:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 822. [2018-02-02 20:10:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-02-02 20:10:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1017 transitions. [2018-02-02 20:10:12,892 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1017 transitions. Word has length 67 [2018-02-02 20:10:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:12,893 INFO L432 AbstractCegarLoop]: Abstraction has 822 states and 1017 transitions. [2018-02-02 20:10:12,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1017 transitions. [2018-02-02 20:10:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:10:12,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:12,893 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 20:10:12,893 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 20:10:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 967862931, now seen corresponding path program 2 times [2018-02-02 20:10:12,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:12,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:13,457 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 20:10:13,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:13,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:10:13,457 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:13,457 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 20:10:13,458 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 20:10:13,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:13,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:13,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:13,458 INFO L87 Difference]: Start difference. First operand 822 states and 1017 transitions. Second operand 24 states. [2018-02-02 20:10:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:15,340 INFO L93 Difference]: Finished difference Result 1264 states and 1536 transitions. [2018-02-02 20:10:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:10:15,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-02-02 20:10:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:15,341 INFO L225 Difference]: With dead ends: 1264 [2018-02-02 20:10:15,341 INFO L226 Difference]: Without dead ends: 1264 [2018-02-02 20:10:15,342 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 20:10:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2018-02-02 20:10:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 852. [2018-02-02 20:10:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-02-02 20:10:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1054 transitions. [2018-02-02 20:10:15,350 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1054 transitions. Word has length 69 [2018-02-02 20:10:15,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:15,350 INFO L432 AbstractCegarLoop]: Abstraction has 852 states and 1054 transitions. [2018-02-02 20:10:15,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:10:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1054 transitions. [2018-02-02 20:10:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:10:15,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:15,351 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 20:10:15,351 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 20:10:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 391027005, now seen corresponding path program 1 times [2018-02-02 20:10:15,351 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:15,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:15,899 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 20:10:15,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:15,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:10:15,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:15,900 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 20:10:15,900 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 20:10:15,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:10:15,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:10:15,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:10:15,900 INFO L87 Difference]: Start difference. First operand 852 states and 1054 transitions. Second operand 20 states. [2018-02-02 20:10:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:17,509 INFO L93 Difference]: Finished difference Result 892 states and 1095 transitions. [2018-02-02 20:10:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:10:17,509 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 20:10:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:17,510 INFO L225 Difference]: With dead ends: 892 [2018-02-02 20:10:17,510 INFO L226 Difference]: Without dead ends: 885 [2018-02-02 20:10:17,510 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 20:10:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-02-02 20:10:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 881. [2018-02-02 20:10:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-02-02 20:10:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1084 transitions. [2018-02-02 20:10:17,516 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1084 transitions. Word has length 70 [2018-02-02 20:10:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:17,516 INFO L432 AbstractCegarLoop]: Abstraction has 881 states and 1084 transitions. [2018-02-02 20:10:17,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:10:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1084 transitions. [2018-02-02 20:10:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:10:17,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:17,516 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 20:10:17,516 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 20:10:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1216320145, now seen corresponding path program 2 times [2018-02-02 20:10:17,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:17,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:18,252 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 20:10:18,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:18,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:10:18,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:18,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 20:10:18,252 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 20:10:18,252 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 20:10:18,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:10:18,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:10:18,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:10:18,253 INFO L87 Difference]: Start difference. First operand 881 states and 1084 transitions. Second operand 26 states. [2018-02-02 20:10:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:20,324 INFO L93 Difference]: Finished difference Result 1308 states and 1590 transitions. [2018-02-02 20:10:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:10:20,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-02-02 20:10:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:20,326 INFO L225 Difference]: With dead ends: 1308 [2018-02-02 20:10:20,326 INFO L226 Difference]: Without dead ends: 1308 [2018-02-02 20:10:20,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=575, Invalid=3331, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:10:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-02-02 20:10:20,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 881. [2018-02-02 20:10:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-02-02 20:10:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1084 transitions. [2018-02-02 20:10:20,332 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1084 transitions. Word has length 71 [2018-02-02 20:10:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:20,332 INFO L432 AbstractCegarLoop]: Abstraction has 881 states and 1084 transitions. [2018-02-02 20:10:20,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:10:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1084 transitions. [2018-02-02 20:10:20,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:10:20,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:20,333 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 20:10:20,333 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 20:10:20,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1338235375, now seen corresponding path program 2 times [2018-02-02 20:10:20,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:20,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:20,811 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 20:10:20,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:20,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:10:20,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:20,811 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 20:10:20,811 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 20:10:20,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:10:20,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:10:20,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:10:20,812 INFO L87 Difference]: Start difference. First operand 881 states and 1084 transitions. Second operand 25 states. [2018-02-02 20:10:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:22,356 INFO L93 Difference]: Finished difference Result 1196 states and 1449 transitions. [2018-02-02 20:10:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:10:22,356 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-02-02 20:10:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:22,357 INFO L225 Difference]: With dead ends: 1196 [2018-02-02 20:10:22,358 INFO L226 Difference]: Without dead ends: 1196 [2018-02-02 20:10:22,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=510, Invalid=2912, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:10:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-02-02 20:10:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 893. [2018-02-02 20:10:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-02-02 20:10:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1097 transitions. [2018-02-02 20:10:22,364 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1097 transitions. Word has length 71 [2018-02-02 20:10:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:22,364 INFO L432 AbstractCegarLoop]: Abstraction has 893 states and 1097 transitions. [2018-02-02 20:10:22,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:10:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1097 transitions. [2018-02-02 20:10:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:10:22,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:22,364 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:22,364 INFO L371 AbstractCegarLoop]: === Iteration 62 === [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 20:10:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash -731718837, now seen corresponding path program 1 times [2018-02-02 20:10:22,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:22,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:22,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:22,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:10:22,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:22,722 INFO L182 omatonBuilderFactory]: Interpolants [69575#true, 69577#(= 0 |main_#t~malloc0.offset|), 69576#false, 69579#(and (= 0 main_~root~0.offset) (= (select |#valid| main_~root~0.base) 1)), 69578#(= 0 main_~root~0.offset), 69581#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= 1 (select |#valid| |main_#t~malloc22.base|)) (= main_~root~0.offset main_~n~0.offset)), 69580#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 69583#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= |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) (= 1 (select |#valid| main_~n~0.base)) (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))))), 69582#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (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))))), 69585#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~root~0.base))), 69584#(and (= 0 main_~root~0.offset) (= 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)))) (= 1 (select |#valid| main_~root~0.base))), 69587#(and (not (= |main_#t~malloc13.base| main_~n~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base)), 69586#(and (not (= main_~n~0.offset (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base))), 69589#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (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))), 69588#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) main_~n~0.base))), 69591#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 69590#(or (and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= 1 (select |#valid| |main_#t~mem17.base|)))), 69593#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 69592#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))), 69595#(= 1 (select |#valid| main_~n~0.base)), 69594#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 20:10:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:22,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:10:22,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:10:22,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:10:22,723 INFO L87 Difference]: Start difference. First operand 893 states and 1097 transitions. Second operand 21 states. [2018-02-02 20:10:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:24,199 INFO L93 Difference]: Finished difference Result 1673 states and 2054 transitions. [2018-02-02 20:10:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:10:24,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-02-02 20:10:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:24,201 INFO L225 Difference]: With dead ends: 1673 [2018-02-02 20:10:24,201 INFO L226 Difference]: Without dead ends: 1673 [2018-02-02 20:10:24,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:10:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2018-02-02 20:10:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 999. [2018-02-02 20:10:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-02-02 20:10:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1241 transitions. [2018-02-02 20:10:24,207 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1241 transitions. Word has length 72 [2018-02-02 20:10:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:24,207 INFO L432 AbstractCegarLoop]: Abstraction has 999 states and 1241 transitions. [2018-02-02 20:10:24,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:10:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1241 transitions. [2018-02-02 20:10:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:10:24,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:24,207 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:24,207 INFO L371 AbstractCegarLoop]: === Iteration 63 === [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 20:10:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -731718836, now seen corresponding path program 1 times [2018-02-02 20:10:24,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:24,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:25,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:25,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:10:25,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:25,082 INFO L182 omatonBuilderFactory]: Interpolants [72337#false, 72336#true, 72339#(= main_~root~0.offset 0), 72338#(= 0 |main_#t~malloc0.offset|), 72341#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)) 0)), 72340#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 72343#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (or (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.base|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc22.base|)) (= (select |#valid| |main_#t~malloc22.base|) 1) (= (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc22.offset|) (+ main_~root~0.offset 4)) |main_#t~malloc22.offset|) (= main_~root~0.offset 0) (= 0 |main_#t~malloc22.offset|)), 72342#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (or (= main_~root~0.offset main_~n~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 72345#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 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) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |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|)) (= main_~root~0.offset 0)), 72344#(and (or (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 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) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 72347#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 1))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 72346#(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))) (or (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)))) (= (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))) 1)) (= 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 4)))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 72349#(and (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (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 |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.base|) (+ main_~root~0.offset 4))))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc13.offset|) (+ main_~root~0.offset 4))) (not (= main_~n~0.base |main_#t~malloc13.base|))), 72348#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (or (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))) 1) (= main_~n~0.base main_~root~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))))), 72351#(and (or (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 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~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_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem15.base|))), 72350#(and (or (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 4))))) (and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (not (= main_~n~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_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 72353#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 72352#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset))), 72355#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (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))))), 72354#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))), 72357#(or (not |main_#t~short6|) (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))))), 72356#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem5.offset| 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_#t~mem5.base| 0))), 72359#(and (= 0 |main_#t~mem9.offset|) (= 8 (select |#length| |main_#t~mem9.base|))), 72358#(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)))), 72360#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-02 20:10:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:25,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:10:25,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:10:25,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:10:25,083 INFO L87 Difference]: Start difference. First operand 999 states and 1241 transitions. Second operand 25 states. [2018-02-02 20:10:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:29,649 INFO L93 Difference]: Finished difference Result 2481 states and 3098 transitions. [2018-02-02 20:10:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 20:10:29,649 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-02-02 20:10:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:29,650 INFO L225 Difference]: With dead ends: 2481 [2018-02-02 20:10:29,650 INFO L226 Difference]: Without dead ends: 2481 [2018-02-02 20:10:29,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1634, Invalid=6022, Unknown=0, NotChecked=0, Total=7656 [2018-02-02 20:10:29,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2018-02-02 20:10:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 1532. [2018-02-02 20:10:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2018-02-02 20:10:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1956 transitions. [2018-02-02 20:10:29,660 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1956 transitions. Word has length 72 [2018-02-02 20:10:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:29,660 INFO L432 AbstractCegarLoop]: Abstraction has 1532 states and 1956 transitions. [2018-02-02 20:10:29,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:10:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1956 transitions. [2018-02-02 20:10:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:10:29,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:29,661 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:29,661 INFO L371 AbstractCegarLoop]: === Iteration 64 === [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 20:10:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2130137286, now seen corresponding path program 1 times [2018-02-02 20:10:29,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:29,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:29,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:29,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:10:29,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:29,712 INFO L182 omatonBuilderFactory]: Interpolants [76501#false, 76500#true, 76503#(and (not (= main_~n~0.base |main_#t~malloc44.base|)) (= 1 (select |#valid| |main_#t~malloc44.base|))), 76502#(= (select |#valid| main_~n~0.base) 1), 76505#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base)), 76504#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 76506#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 20:10:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:29,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:10:29,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:10:29,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:29,712 INFO L87 Difference]: Start difference. First operand 1532 states and 1956 transitions. Second operand 7 states. [2018-02-02 20:10:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:29,882 INFO L93 Difference]: Finished difference Result 1550 states and 1976 transitions. [2018-02-02 20:10:29,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:10:29,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 20:10:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:29,883 INFO L225 Difference]: With dead ends: 1550 [2018-02-02 20:10:29,883 INFO L226 Difference]: Without dead ends: 1550 [2018-02-02 20:10:29,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:10:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2018-02-02 20:10:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1539. [2018-02-02 20:10:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1539 states. [2018-02-02 20:10:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 1967 transitions. [2018-02-02 20:10:29,891 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 1967 transitions. Word has length 73 [2018-02-02 20:10:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:29,891 INFO L432 AbstractCegarLoop]: Abstraction has 1539 states and 1967 transitions. [2018-02-02 20:10:29,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:10:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1967 transitions. [2018-02-02 20:10:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:10:29,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:29,892 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:29,892 INFO L371 AbstractCegarLoop]: === Iteration 65 === [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 20:10:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2130137287, now seen corresponding path program 1 times [2018-02-02 20:10:29,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:29,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:29,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:29,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:29,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:29,934 INFO L182 omatonBuilderFactory]: Interpolants [79609#false, 79608#true, 79611#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base))), 79610#(and (= 8 (select |#length| |main_#t~malloc44.base|)) (= 0 |main_#t~malloc44.offset|)), 79612#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0))] [2018-02-02 20:10:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:29,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:29,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:29,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:29,934 INFO L87 Difference]: Start difference. First operand 1539 states and 1967 transitions. Second operand 5 states. [2018-02-02 20:10:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:30,041 INFO L93 Difference]: Finished difference Result 1601 states and 2029 transitions. [2018-02-02 20:10:30,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:30,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-02-02 20:10:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:30,042 INFO L225 Difference]: With dead ends: 1601 [2018-02-02 20:10:30,042 INFO L226 Difference]: Without dead ends: 1601 [2018-02-02 20:10:30,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2018-02-02 20:10:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1541. [2018-02-02 20:10:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2018-02-02 20:10:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1967 transitions. [2018-02-02 20:10:30,051 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1967 transitions. Word has length 73 [2018-02-02 20:10:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:30,052 INFO L432 AbstractCegarLoop]: Abstraction has 1541 states and 1967 transitions. [2018-02-02 20:10:30,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1967 transitions. [2018-02-02 20:10:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:10:30,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:30,053 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:30,053 INFO L371 AbstractCegarLoop]: === Iteration 66 === [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 20:10:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1309312794, now seen corresponding path program 1 times [2018-02-02 20:10:30,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:30,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:30,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:30,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:10:30,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:30,115 INFO L182 omatonBuilderFactory]: Interpolants [82761#true, 82763#(= 1 (select |#valid| main_~n~0.base)), 82762#false, 82765#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 82764#(and (not (= |main_#t~malloc39.base| main_~n~0.base)) (= 1 (select |#valid| |main_#t~malloc39.base|))), 82767#(= 1 (select |#valid| main_~s~0.base)), 82766#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base))] [2018-02-02 20:10:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:30,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:10:30,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:10:30,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:30,116 INFO L87 Difference]: Start difference. First operand 1541 states and 1967 transitions. Second operand 7 states. [2018-02-02 20:10:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:30,299 INFO L93 Difference]: Finished difference Result 1585 states and 2015 transitions. [2018-02-02 20:10:30,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:10:30,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 20:10:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:30,300 INFO L225 Difference]: With dead ends: 1585 [2018-02-02 20:10:30,300 INFO L226 Difference]: Without dead ends: 1585 [2018-02-02 20:10:30,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:10:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2018-02-02 20:10:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1549. [2018-02-02 20:10:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-02-02 20:10:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1981 transitions. [2018-02-02 20:10:30,309 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1981 transitions. Word has length 73 [2018-02-02 20:10:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:30,309 INFO L432 AbstractCegarLoop]: Abstraction has 1549 states and 1981 transitions. [2018-02-02 20:10:30,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:10:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1981 transitions. [2018-02-02 20:10:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:10:30,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:30,309 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:30,310 INFO L371 AbstractCegarLoop]: === Iteration 67 === [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 20:10:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1309312793, now seen corresponding path program 1 times [2018-02-02 20:10:30,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:30,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:30,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:30,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:30,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:30,358 INFO L182 omatonBuilderFactory]: Interpolants [85921#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base))), 85920#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 85922#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0)), 85919#false, 85918#true] [2018-02-02 20:10:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:30,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:30,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:30,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:30,358 INFO L87 Difference]: Start difference. First operand 1549 states and 1981 transitions. Second operand 5 states. [2018-02-02 20:10:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:30,508 INFO L93 Difference]: Finished difference Result 1634 states and 2067 transitions. [2018-02-02 20:10:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:30,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-02-02 20:10:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:30,509 INFO L225 Difference]: With dead ends: 1634 [2018-02-02 20:10:30,509 INFO L226 Difference]: Without dead ends: 1634 [2018-02-02 20:10:30,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 20:10:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-02-02 20:10:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1542. [2018-02-02 20:10:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-02-02 20:10:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1970 transitions. [2018-02-02 20:10:30,517 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1970 transitions. Word has length 73 [2018-02-02 20:10:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:30,517 INFO L432 AbstractCegarLoop]: Abstraction has 1542 states and 1970 transitions. [2018-02-02 20:10:30,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1970 transitions. [2018-02-02 20:10:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:10:30,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:30,518 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:30,518 INFO L371 AbstractCegarLoop]: === Iteration 68 === [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 20:10:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash -387083614, now seen corresponding path program 1 times [2018-02-02 20:10:30,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:30,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:10:30,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:30,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:10:30,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:30,663 INFO L182 omatonBuilderFactory]: Interpolants [89121#(not (= main_~n~0.base |main_~#sentinel~0.base|)), 89120#(not (= main_~succ~0.base |main_~#sentinel~0.base|)), 89107#true, 89109#(= (select |#valid| main_~root~0.base) 1), 89108#false, 89111#(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|))), 89110#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 89113#(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|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)) 1)), 89112#(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_~root~0.offset)) 1)), 89115#(= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 1), 89114#(and (not (= main_~n~0.base |main_#t~mem17.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset)) 1)), 89117#(not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#sentinel~0.base|)), 89116#(not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset) |main_~#sentinel~0.base|)), 89119#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#sentinel~0.base|)) (= main_~succ~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 89118#(and (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#sentinel~0.base|)))] [2018-02-02 20:10:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:10:30,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:10:30,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:10:30,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:30,664 INFO L87 Difference]: Start difference. First operand 1542 states and 1970 transitions. Second operand 15 states. [2018-02-02 20:10:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:31,329 INFO L93 Difference]: Finished difference Result 2072 states and 2596 transitions. [2018-02-02 20:10:31,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:10:31,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-02-02 20:10:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:31,330 INFO L225 Difference]: With dead ends: 2072 [2018-02-02 20:10:31,330 INFO L226 Difference]: Without dead ends: 2072 [2018-02-02 20:10:31,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:10:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2018-02-02 20:10:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1542. [2018-02-02 20:10:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-02-02 20:10:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1969 transitions. [2018-02-02 20:10:31,339 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1969 transitions. Word has length 74 [2018-02-02 20:10:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:31,339 INFO L432 AbstractCegarLoop]: Abstraction has 1542 states and 1969 transitions. [2018-02-02 20:10:31,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:10:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1969 transitions. [2018-02-02 20:10:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:10:31,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:31,339 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:31,340 INFO L371 AbstractCegarLoop]: === Iteration 69 === [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 20:10:31,340 INFO L82 PathProgramCache]: Analyzing trace with hash 778227876, now seen corresponding path program 1 times [2018-02-02 20:10:31,340 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:31,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:31,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:31,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:10:31,365 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:31,365 INFO L182 omatonBuilderFactory]: Interpolants [92785#false, 92784#true, 92787#(not (= main_~st~0.base 0)), 92786#(not (= |main_#t~malloc44.base| 0)), 92788#(not (= main_~s~0.base 0))] [2018-02-02 20:10:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:31,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:31,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:31,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:31,365 INFO L87 Difference]: Start difference. First operand 1542 states and 1969 transitions. Second operand 5 states. [2018-02-02 20:10:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:31,399 INFO L93 Difference]: Finished difference Result 1616 states and 2051 transitions. [2018-02-02 20:10:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:31,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-02-02 20:10:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:31,400 INFO L225 Difference]: With dead ends: 1616 [2018-02-02 20:10:31,400 INFO L226 Difference]: Without dead ends: 1616 [2018-02-02 20:10:31,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 20:10:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2018-02-02 20:10:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1546. [2018-02-02 20:10:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-02-02 20:10:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1974 transitions. [2018-02-02 20:10:31,407 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 1974 transitions. Word has length 76 [2018-02-02 20:10:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:31,407 INFO L432 AbstractCegarLoop]: Abstraction has 1546 states and 1974 transitions. [2018-02-02 20:10:31,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1974 transitions. [2018-02-02 20:10:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:10:31,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:31,408 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:31,408 INFO L371 AbstractCegarLoop]: === Iteration 70 === [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 20:10:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1155675268, now seen corresponding path program 1 times [2018-02-02 20:10:31,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:31,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:31,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:31,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:10:31,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:31,427 INFO L182 omatonBuilderFactory]: Interpolants [95957#true, 95959#(not (= 0 |main_#t~malloc39.base|)), 95958#false, 95961#(not (= 0 main_~s~0.base)), 95960#(not (= 0 main_~st~0.base))] [2018-02-02 20:10:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:10:31,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:31,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:31,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:31,427 INFO L87 Difference]: Start difference. First operand 1546 states and 1974 transitions. Second operand 5 states. [2018-02-02 20:10:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:31,461 INFO L93 Difference]: Finished difference Result 1629 states and 2059 transitions. [2018-02-02 20:10:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:31,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-02-02 20:10:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:31,462 INFO L225 Difference]: With dead ends: 1629 [2018-02-02 20:10:31,462 INFO L226 Difference]: Without dead ends: 1629 [2018-02-02 20:10:31,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 20:10:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2018-02-02 20:10:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1542. [2018-02-02 20:10:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-02-02 20:10:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1968 transitions. [2018-02-02 20:10:31,470 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1968 transitions. Word has length 76 [2018-02-02 20:10:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:31,470 INFO L432 AbstractCegarLoop]: Abstraction has 1542 states and 1968 transitions. [2018-02-02 20:10:31,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1968 transitions. [2018-02-02 20:10:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:10:31,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:31,471 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:31,471 INFO L371 AbstractCegarLoop]: === Iteration 71 === [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 20:10:31,471 INFO L82 PathProgramCache]: Analyzing trace with hash 584180845, now seen corresponding path program 1 times [2018-02-02 20:10:31,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:31,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:31,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:31,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:10:31,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:31,939 INFO L182 omatonBuilderFactory]: Interpolants [99141#true, 99143#(= 0 |main_#t~malloc0.offset|), 99142#false, 99145#(and (= 0 main_~n~0.offset) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0)), 99144#(= main_~root~0.offset 0), 99147#(and (= 0 main_~n~0.offset) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 99146#(and (= 0 main_~pred~0.offset) (= main_~root~0.offset 0) (= main_~pred~0.base main_~root~0.base)), 99149#(and (= 0 main_~pred~0.offset) (= main_~n~0.base main_~root~0.base) (= 0 main_~pred~0.base) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 99148#(and (= 0 main_~pred~0.offset) (= 1 (select |#valid| main_~pred~0.base)) (= main_~root~0.offset 0) (= main_~pred~0.base main_~root~0.base)), 99151#(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))) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 99150#(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_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 99153#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (not (= main_~s~0.base main_~root~0.base))), 99152#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|))), 99155#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0)), 99154#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) (+ main_~root~0.offset 4)))), 99157#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 99156#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 99159#(and (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) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 99158#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4))) (= main_~st~0.offset 0)), 99161#(and (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)))) (<= 1 main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1)), 99160#(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) (<= 1 main_~n~0.offset)), 99163#(and (<= 1 main_~n~0.offset) (= (select |#valid| main_~n~0.base) 1)), 99162#(and (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem43.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))))) (= (select |#valid| main_~n~0.base) 1)), 99165#(and (not (= main_~n~0.base main_~st~0.base)) (or (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base))))), 99164#(and (or (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base)))) (not (= main_~n~0.base |main_#t~malloc44.base|))), 99166#(and (<= 1 main_~n~0.offset) (not (= main_~n~0.base main_~st~0.base)) (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 20:10:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:10:31,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:10:31,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:10:31,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:10:31,940 INFO L87 Difference]: Start difference. First operand 1542 states and 1968 transitions. Second operand 26 states. [2018-02-02 20:10:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:33,285 INFO L93 Difference]: Finished difference Result 1771 states and 2221 transitions. [2018-02-02 20:10:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:10:33,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 78 [2018-02-02 20:10:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:33,302 INFO L225 Difference]: With dead ends: 1771 [2018-02-02 20:10:33,302 INFO L226 Difference]: Without dead ends: 1762 [2018-02-02 20:10:33,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=444, Invalid=2312, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:10:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2018-02-02 20:10:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1561. [2018-02-02 20:10:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-02-02 20:10:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1989 transitions. [2018-02-02 20:10:33,310 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1989 transitions. Word has length 78 [2018-02-02 20:10:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:33,310 INFO L432 AbstractCegarLoop]: Abstraction has 1561 states and 1989 transitions. [2018-02-02 20:10:33,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:10:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1989 transitions. [2018-02-02 20:10:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:10:33,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:33,311 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:33,311 INFO L371 AbstractCegarLoop]: === Iteration 72 === [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 20:10:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1761095603, now seen corresponding path program 1 times [2018-02-02 20:10:33,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:33,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:33,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:33,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:10:33,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:33,862 INFO L182 omatonBuilderFactory]: Interpolants [102561#(and (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ 0 4))) (= 1 (select |#valid| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ 0 4))) (= main_~root~0.offset 0)), 102560#(and (= 0 main_~pred~0.offset) (= 0 main_~pred~0.base) (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 102563#(and (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~mem30.offset|) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (= main_~n~0.offset main_~root~0.offset) (= 0 |main_#t~mem30.base|)), 102562#(and (= 0 main_~pred~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~pred~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) (+ 0 4))) (= 1 (select |#valid| main_~pred~0.base)) (= main_~root~0.offset 0) (= main_~pred~0.base main_~root~0.base)), 102565#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 102564#(and (= main_~n~0.base main_~root~0.base) (= 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 (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| main_~n~0.base)) (= main_~n~0.offset main_~root~0.offset)), 102567#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 102566#(and (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 102569#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))), 102568#(and (= main_~s~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 102571#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 102570#(and (= main_~s~0.offset main_~st~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 102573#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 102572#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= main_~st~0.offset 0)), 102575#(and (= |main_#t~mem38.base| 0) (= |main_#t~mem38.offset| 0) (= 1 (select |#valid| main_~n~0.base))), 102574#(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))), 102576#(not (= 1 (select |#valid| main_~n~0.base))), 102553#true, 102555#(= 0 |main_#t~malloc0.offset|), 102554#false, 102557#(and (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 102556#(= main_~root~0.offset 0), 102559#(and (= 0 main_~pred~0.offset) (= 0 main_~pred~0.base) (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0)), 102558#(and (= 0 main_~pred~0.offset) (= main_~root~0.offset 0) (= main_~pred~0.base main_~root~0.base))] [2018-02-02 20:10:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:33,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:10:33,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:10:33,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:33,863 INFO L87 Difference]: Start difference. First operand 1561 states and 1989 transitions. Second operand 24 states. [2018-02-02 20:10:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:35,176 INFO L93 Difference]: Finished difference Result 1725 states and 2173 transitions. [2018-02-02 20:10:35,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:10:35,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-02-02 20:10:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:35,177 INFO L225 Difference]: With dead ends: 1725 [2018-02-02 20:10:35,177 INFO L226 Difference]: Without dead ends: 1674 [2018-02-02 20:10:35,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:10:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-02-02 20:10:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1511. [2018-02-02 20:10:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-02-02 20:10:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1934 transitions. [2018-02-02 20:10:35,184 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1934 transitions. Word has length 78 [2018-02-02 20:10:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:35,184 INFO L432 AbstractCegarLoop]: Abstraction has 1511 states and 1934 transitions. [2018-02-02 20:10:35,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:10:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1934 transitions. [2018-02-02 20:10:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:10:35,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:35,185 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:35,185 INFO L371 AbstractCegarLoop]: === Iteration 73 === [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 20:10:35,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2052333539, now seen corresponding path program 1 times [2018-02-02 20:10:35,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:35,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:35,946 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 20:10:35,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:35,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:10:35,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:35,947 INFO L182 omatonBuilderFactory]: Interpolants [105865#true, 105867#(= 0 |main_#t~malloc0.offset|), 105866#false, 105869#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 105868#(= main_~root~0.offset 0), 105871#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc13.base|) 1) (= 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|)), 105870#(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)), 105873#(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_~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_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 105872#(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_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 105875#(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) (= 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))) (= 0 (select (select |#memory_$Pointer$.offset| 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)), 105874#(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) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem17.offset| 0) (= main_~root~0.offset 0) (= 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)), 105877#(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))) (= 0 (select (select |#memory_$Pointer$.offset| 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)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (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))))), 105876#(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_#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)) (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (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)) (= 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)) (+ main_~root~0.offset 4))) (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|)) (= main_~root~0.offset 0) (= 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)))), 105879#(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$.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)) (+ 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)) (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)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 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))), 105878#(and (= 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)) (+ main_~root~0.offset 4))) (= 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)) (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)) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (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))))), 105881#(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))), 105880#(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)))), 105883#(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))), 105882#(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)))), 105885#(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)))), 105884#(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)))), 105887#(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)))), 105886#(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)), 105889#(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))), 105888#(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)))), 105891#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 105890#(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))), 105893#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base)), 105892#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base))] [2018-02-02 20:10:35,947 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 20:10:35,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:10:35,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:10:35,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:10:35,948 INFO L87 Difference]: Start difference. First operand 1511 states and 1934 transitions. Second operand 29 states. [2018-02-02 20:10:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:38,352 INFO L93 Difference]: Finished difference Result 2140 states and 2683 transitions. [2018-02-02 20:10:38,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:10:38,384 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-02-02 20:10:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:38,385 INFO L225 Difference]: With dead ends: 2140 [2018-02-02 20:10:38,385 INFO L226 Difference]: Without dead ends: 2140 [2018-02-02 20:10:38,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=743, Invalid=4513, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:10:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2018-02-02 20:10:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1511. [2018-02-02 20:10:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-02-02 20:10:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1934 transitions. [2018-02-02 20:10:38,393 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1934 transitions. Word has length 79 [2018-02-02 20:10:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:38,393 INFO L432 AbstractCegarLoop]: Abstraction has 1511 states and 1934 transitions. [2018-02-02 20:10:38,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:10:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1934 transitions. [2018-02-02 20:10:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:10:38,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:38,394 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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 20:10:38,394 INFO L371 AbstractCegarLoop]: === Iteration 74 === [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 20:10:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1307361345, now seen corresponding path program 3 times [2018-02-02 20:10:38,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:38,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:39,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:39,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:10:39,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:39,223 INFO L182 omatonBuilderFactory]: Interpolants [109633#true, 109635#(= 0 |main_#t~malloc0.offset|), 109634#false, 109637#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 109636#(= main_~root~0.offset 0), 109639#(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|)), 109638#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 109641#(and (= (select (select |#memory_$Pointer$.offset| 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) (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))))), 109640#(and (= (select (select |#memory_$Pointer$.offset| 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) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 109643#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ 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) (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ main_~root~0.offset 4)))), 109642#(and (= |main_#t~mem26.offset| 0) (= 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 4)) 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)))), 109645#(and (= 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 4))) (= |main_~#sentinel~0.offset| (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)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (+ 0 4))) (= 0 |main_~#sentinel~0.offset|)), 109644#(and (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ 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 |main_~#sentinel~0.offset|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (+ main_~root~0.offset 4)))), 109647#(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))) (= 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 4))) (= 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)) (= 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 4))) (= 0 |main_~#sentinel~0.offset|)), 109646#(and (= |main_#t~mem30.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem30.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 |main_#t~mem30.offset|)) |main_#t~mem30.base|) (+ 0 4))) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 |main_~#sentinel~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 |main_#t~mem30.base|)) |main_#t~mem30.base|) (+ 0 4)))), 109649#(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 |main_~#sentinel~0.offset|) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 109648#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (+ 0 4))) (not (= main_~pred~0.base (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))) (= 0 |main_~#sentinel~0.offset|) (= |main_~#sentinel~0.offset| (select (select |#memory_$Pointer$.offset| main_~pred~0.base) main_~pred~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset)) (+ 0 4)))), 109651#(and (= 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)) (= 0 |main_~#sentinel~0.offset|) (= |main_~#sentinel~0.offset| main_~succ~0.offset)), 109650#(and (= |main_~#sentinel~0.offset| |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))) (= 0 |main_~#sentinel~0.offset|)), 109653#(and (= 0 (select (select |#memory_$Pointer$.base| main_~succ~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~succ~0.base) (+ 0 4))) (= 0 |main_~#sentinel~0.offset|) (= |main_~#sentinel~0.offset| main_~succ~0.offset)), 109652#(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 (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))) (= 0 |main_~#sentinel~0.offset|) (= |main_~#sentinel~0.offset| main_~succ~0.offset)), 109655#(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)))), 109654#(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)))), 109657#(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))), 109656#(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))), 109659#(and (= 0 main_~succ~0.offset) (= 0 main_~succ~0.base)), 109658#(and (= 0 |main_#t~mem28.offset|) (= 0 |main_#t~mem28.base|)), 109660#(and (= main_~n~0.offset 0) (= 0 main_~n~0.base))] [2018-02-02 20:10:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:39,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:10:39,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:10:39,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:10:39,223 INFO L87 Difference]: Start difference. First operand 1511 states and 1934 transitions. Second operand 28 states. [2018-02-02 20:10:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:41,682 INFO L93 Difference]: Finished difference Result 2148 states and 2702 transitions. [2018-02-02 20:10:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:10:41,682 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-02-02 20:10:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:41,683 INFO L225 Difference]: With dead ends: 2148 [2018-02-02 20:10:41,683 INFO L226 Difference]: Without dead ends: 2148 [2018-02-02 20:10:41,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=682, Invalid=4720, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 20:10:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-02-02 20:10:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1511. [2018-02-02 20:10:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-02-02 20:10:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1934 transitions. [2018-02-02 20:10:41,693 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1934 transitions. Word has length 81 [2018-02-02 20:10:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:41,693 INFO L432 AbstractCegarLoop]: Abstraction has 1511 states and 1934 transitions. [2018-02-02 20:10:41,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:10:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1934 transitions. [2018-02-02 20:10:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:10:41,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:41,694 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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 20:10:41,694 INFO L371 AbstractCegarLoop]: === Iteration 75 === [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 20:10:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash 5835839, now seen corresponding path program 3 times [2018-02-02 20:10:41,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:41,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:42,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:42,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:10:42,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:42,008 INFO L182 omatonBuilderFactory]: Interpolants [113413#false, 113412#true, 113415#(= main_~root~0.offset 0), 113414#(= 0 |main_#t~malloc0.offset|), 113417#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 113416#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 113419#(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) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 113418#(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|)), 113421#(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) (= main_~root~0.offset 0)), 113420#(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|)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 113423#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 113422#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 113425#(and (= 0 |main_#t~mem28.offset|) (= 1 (select |#valid| main_~n~0.base))), 113424#(= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)), 113427#(and (= main_~n~0.offset 0) (= 1 (select |#valid| main_~pred~0.base))), 113426#(and (= 0 main_~succ~0.offset) (= 1 (select |#valid| main_~n~0.base))), 113429#(and (or (<= (+ main_~pred~0.offset 1) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~pred~0.base) (+ main_~pred~0.offset 4))))) (<= main_~pred~0.offset 0)), 113428#(and (= main_~n~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ 0 4))))), 113431#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 113430#(or (<= (+ main_~n~0.offset 1) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 113433#(= 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))), 113432#(= 1 (select |#valid| |main_#t~mem30.base|)), 113435#(= 1 (select |#valid| |main_#t~mem28.base|)), 113434#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~pred~0.base) main_~pred~0.offset))), 113437#(= 1 (select |#valid| main_~n~0.base)), 113436#(= 1 (select |#valid| main_~succ~0.base))] [2018-02-02 20:10:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:42,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:10:42,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:10:42,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:10:42,008 INFO L87 Difference]: Start difference. First operand 1511 states and 1934 transitions. Second operand 26 states. [2018-02-02 20:10:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:43,756 INFO L93 Difference]: Finished difference Result 2145 states and 2680 transitions. [2018-02-02 20:10:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:10:43,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-02-02 20:10:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:43,757 INFO L225 Difference]: With dead ends: 2145 [2018-02-02 20:10:43,757 INFO L226 Difference]: Without dead ends: 2145 [2018-02-02 20:10:43,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=653, Invalid=3507, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:10:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2018-02-02 20:10:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1560. [2018-02-02 20:10:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-02-02 20:10:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1988 transitions. [2018-02-02 20:10:43,765 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1988 transitions. Word has length 81 [2018-02-02 20:10:43,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:43,765 INFO L432 AbstractCegarLoop]: Abstraction has 1560 states and 1988 transitions. [2018-02-02 20:10:43,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:10:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1988 transitions. [2018-02-02 20:10:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:10:43,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:43,766 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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 20:10:43,766 INFO L371 AbstractCegarLoop]: === Iteration 76 === [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 20:10:43,766 INFO L82 PathProgramCache]: Analyzing trace with hash 5835840, now seen corresponding path program 2 times [2018-02-02 20:10:43,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:43,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:44,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:44,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:10:44,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:44,379 INFO L182 omatonBuilderFactory]: Interpolants [117248#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8)), 117221#true, 117223#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= |main_#t~malloc0.offset| 0)), 117222#false, 117225#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 117224#(and (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 117227#(and (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~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|)), 117226#(and (= (select |#valid| main_~n~0.base) 1) (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 117229#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem15.base|)) (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 117228#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 117231#(and (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 117230#(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)) (= 8 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0)), 117233#(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 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0)), 117232#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (= 8 (select |#length| main_~root~0.base))), 117235#(and (= 0 main_~n~0.offset) (= 8 (select |#length| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 117234#(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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 117237#(and (= 0 main_~n~0.offset) (= 0 main_~succ~0.offset) (= 8 (select |#length| main_~n~0.base))), 117236#(and (= 0 main_~n~0.offset) (= 0 |main_#t~mem28.offset|) (= 8 (select |#length| main_~n~0.base))), 117239#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ 0 4)))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ 0 4)))), 117238#(and (= 0 main_~pred~0.offset) (= main_~n~0.offset 0) (= 8 (select |#length| main_~pred~0.base))), 117241#(or (<= (+ main_~n~0.offset 1) 0) (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))), 117240#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~pred~0.base) (+ 0 4))) (<= main_~pred~0.offset 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~pred~0.base) (+ main_~pred~0.offset 4)))) (<= (+ main_~pred~0.offset 1) 0))), 117243#(and (= 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)) (<= 0 main_~n~0.offset)), 117242#(and (= 0 |main_#t~mem30.offset|) (= 8 (select |#length| |main_#t~mem30.base|)) (<= main_~n~0.offset 0) (<= 0 main_~n~0.offset)), 117245#(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))), 117244#(and (= 8 (select |#length| (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))), 117247#(and (= 8 (select |#length| main_~succ~0.base)) (= 0 main_~succ~0.offset)), 117246#(and (= 8 (select |#length| |main_#t~mem28.base|)) (= 0 |main_#t~mem28.offset|))] [2018-02-02 20:10:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:44,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:10:44,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:10:44,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:10:44,380 INFO L87 Difference]: Start difference. First operand 1560 states and 1988 transitions. Second operand 28 states. Received shutdown request... [2018-02-02 20:10:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:10:45,817 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:10:45,822 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:10:45,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:10:45 BoogieIcfgContainer [2018-02-02 20:10:45,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:10:45,822 INFO L168 Benchmark]: Toolchain (without parser) took 72489.25 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 897.1 MB). Free memory was 353.9 MB in the beginning and 1.2 GB in the end (delta: -851.9 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:45,823 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 400.0 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:10:45,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.13 ms. Allocated memory is still 400.0 MB. Free memory was 353.9 MB in the beginning and 340.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:45,823 INFO L168 Benchmark]: Boogie Preprocessor took 30.45 ms. Allocated memory is still 400.0 MB. Free memory is still 340.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:10:45,823 INFO L168 Benchmark]: RCFGBuilder took 426.72 ms. Allocated memory is still 400.0 MB. Free memory was 340.6 MB in the beginning and 294.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:10:45,824 INFO L168 Benchmark]: TraceAbstraction took 71861.45 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 897.1 MB). Free memory was 294.3 MB in the beginning and 1.2 GB in the end (delta: -911.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:10:45,824 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.10 ms. Allocated memory is still 400.0 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.13 ms. Allocated memory is still 400.0 MB. Free memory was 353.9 MB in the beginning and 340.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.45 ms. Allocated memory is still 400.0 MB. Free memory is still 340.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 426.72 ms. Allocated memory is still 400.0 MB. Free memory was 340.6 MB in the beginning and 294.3 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71861.45 ms. Allocated memory was 400.0 MB in the beginning and 1.3 GB in the end (delta: 897.1 MB). Free memory was 294.3 MB in the beginning and 1.2 GB in the end (delta: -911.4 MB). There was no memory consumed. 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 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 (1560states) and interpolant automaton (currently 32 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (442 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 75 error locations. TIMEOUT Result, 71.8s OverallTime, 76 OverallIterations, 5 TraceHistogramMax, 54.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10188 SDtfs, 34578 SDslu, 56439 SDs, 0 SdLazy, 65996 SolverSat, 4587 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2108 GetRequests, 185 SyntacticMatches, 72 SemanticMatches, 1851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18721 ImplicationChecksByTransitivity, 35.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1561occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 971/1718 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, 75 MinimizatonAttempts, 14887 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 3983 NumberOfCodeBlocks, 3983 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3907 ConstructedInterpolants, 0 QuantifiedInterpolants, 2806456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 36 PerfectInterpolantSequences, 971/1718 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_20-10-45-829.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_20-10-45-829.csv Completed graceful shutdown