java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:30:00,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:30:00,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:30:00,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:30:00,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:30:00,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:30:00,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:30:00,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:30:00,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:30:00,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:30:00,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:30:00,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:30:00,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:30:00,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:30:00,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:30:00,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:30:00,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:30:00,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:30:00,190 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:30:00,191 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:30:00,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:30:00,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:30:00,193 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:30:00,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:30:00,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:30:00,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:30:00,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:30:00,196 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:30:00,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:30:00,196 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:30:00,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:30:00,197 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:30:00,206 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:30:00,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:30:00,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:30:00,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:30:00,207 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:30:00,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:30:00,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:30:00,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:30:00,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:30:00,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:30:00,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:30:00,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:30:00,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:30:00,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:30:00,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:30:00,248 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:30:00,251 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:30:00,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:30:00,253 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:30:00,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:00,386 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:30:00,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:30:00,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:00,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:30:00,392 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:30:00,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbd5d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00, skipping insertion in model container [2018-02-02 10:30:00,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,409 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:00,441 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:30:00,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:00,546 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:30:00,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00 WrapperNode [2018-02-02 10:30:00,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:30:00,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:30:00,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:30:00,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:30:00,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... [2018-02-02 10:30:00,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:30:00,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:30:00,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:30:00,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:30:00,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:30:00,637 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:30:00,638 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:30:00,638 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:30:00,638 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:30:00,639 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:30:01,011 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:30:01,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:01 BoogieIcfgContainer [2018-02-02 10:30:01,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:30:01,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:30:01,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:30:01,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:30:01,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:30:00" (1/3) ... [2018-02-02 10:30:01,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a2444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:01, skipping insertion in model container [2018-02-02 10:30:01,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:30:00" (2/3) ... [2018-02-02 10:30:01,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176a2444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:30:01, skipping insertion in model container [2018-02-02 10:30:01,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:30:01" (3/3) ... [2018-02-02 10:30:01,017 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:30:01,022 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:30:01,031 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 10:30:01,055 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:30:01,056 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:30:01,056 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:30:01,056 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:30:01,056 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:30:01,056 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:30:01,056 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:30:01,057 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:30:01,057 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:30:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-02-02 10:30:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:01,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:01,076 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:01,076 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 460791465, now seen corresponding path program 1 times [2018-02-02 10:30:01,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:01,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:01,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:01,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,190 INFO L182 omatonBuilderFactory]: Interpolants [134#true, 135#false, 136#(= 1 (select |#valid| |main_#t~malloc0.base|)), 137#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:30:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:01,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:01,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:01,201 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-02-02 10:30:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:01,573 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2018-02-02 10:30:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:01,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:01,580 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:30:01,580 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:30:01,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:30:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2018-02-02 10:30:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:30:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-02-02 10:30:01,610 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 8 [2018-02-02 10:30:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:01,611 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-02-02 10:30:01,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-02-02 10:30:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:30:01,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:01,611 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:01,611 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash 460791466, now seen corresponding path program 1 times [2018-02-02 10:30:01,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:01,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:01,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:01,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,676 INFO L182 omatonBuilderFactory]: Interpolants [417#true, 418#false, 419#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 420#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 10:30:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:01,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:01,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:01,679 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 4 states. [2018-02-02 10:30:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:01,962 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-02-02 10:30:01,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:30:01,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:30:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:01,963 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:30:01,964 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:30:01,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:30:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-02-02 10:30:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:30:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-02-02 10:30:01,971 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 8 [2018-02-02 10:30:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:01,972 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-02-02 10:30:01,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-02-02 10:30:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:30:01,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:01,973 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:01,973 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash 108566574, now seen corresponding path program 1 times [2018-02-02 10:30:01,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:01,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:02,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:02,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,076 INFO L182 omatonBuilderFactory]: Interpolants [691#true, 692#false, 693#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 694#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 695#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:02,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:02,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:02,077 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 5 states. [2018-02-02 10:30:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:02,263 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-02-02 10:30:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:02,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:30:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:02,265 INFO L225 Difference]: With dead ends: 223 [2018-02-02 10:30:02,265 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 10:30:02,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 10:30:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2018-02-02 10:30:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:30:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2018-02-02 10:30:02,274 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 15 [2018-02-02 10:30:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:02,275 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2018-02-02 10:30:02,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2018-02-02 10:30:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:30:02,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:02,276 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:02,276 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash 108566573, now seen corresponding path program 1 times [2018-02-02 10:30:02,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:02,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:02,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:02,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,322 INFO L182 omatonBuilderFactory]: Interpolants [1088#true, 1089#false, 1090#(= 1 (select |#valid| main_~head~0.base)), 1091#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:30:02,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:30:02,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:30:02,323 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand 4 states. [2018-02-02 10:30:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:02,413 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-02-02 10:30:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:02,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:30:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:02,414 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:30:02,414 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:30:02,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:30:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-02 10:30:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:30:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-02-02 10:30:02,420 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 15 [2018-02-02 10:30:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:02,420 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-02-02 10:30:02,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:30:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-02-02 10:30:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:30:02,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:02,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:02,421 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 197081690, now seen corresponding path program 1 times [2018-02-02 10:30:02,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:02,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:02,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:02,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,509 INFO L182 omatonBuilderFactory]: Interpolants [1396#true, 1397#false, 1398#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1399#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1400#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:30:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:02,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:02,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:02,510 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-02-02 10:30:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:02,708 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2018-02-02 10:30:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:30:02,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:30:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:02,709 INFO L225 Difference]: With dead ends: 240 [2018-02-02 10:30:02,709 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 10:30:02,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 10:30:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 149. [2018-02-02 10:30:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:30:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-02-02 10:30:02,716 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 18 [2018-02-02 10:30:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:02,716 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-02-02 10:30:02,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-02-02 10:30:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:30:02,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:02,717 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:02,717 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash 197081689, now seen corresponding path program 1 times [2018-02-02 10:30:02,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:02,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:02,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 10:30:02,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:02,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:02,762 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:02,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 10:30:02,763 INFO L182 omatonBuilderFactory]: Interpolants [1796#true, 1797#false, 1798#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1799#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1800#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 10:30:02,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 10:30:02,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:02,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:02,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:02,763 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-02-02 10:30:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:02,895 INFO L93 Difference]: Finished difference Result 212 states and 223 transitions. [2018-02-02 10:30:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:02,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:30:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:02,896 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:30:02,896 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:30:02,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:30:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 148. [2018-02-02 10:30:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:30:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-02 10:30:02,900 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 18 [2018-02-02 10:30:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:02,900 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-02 10:30:02,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-02 10:30:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:30:02,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:02,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] [2018-02-02 10:30:02,901 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1794584241, now seen corresponding path program 1 times [2018-02-02 10:30:02,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:02,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:02,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:02,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,938 INFO L182 omatonBuilderFactory]: Interpolants [2165#true, 2166#false, 2167#(= 1 (select |#valid| |main_#t~malloc12.base|)), 2168#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2169#(= 1 (select |#valid| |main_#t~mem14.base|))] [2018-02-02 10:30:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:02,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:02,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:02,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:02,938 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 5 states. [2018-02-02 10:30:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:03,013 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-02-02 10:30:03,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:30:03,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:30:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:03,014 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:30:03,014 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:30:03,014 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:30:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:30:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-02-02 10:30:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:30:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-02 10:30:03,018 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 19 [2018-02-02 10:30:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:03,018 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-02 10:30:03,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-02 10:30:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:30:03,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:03,018 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:03,018 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1794584242, now seen corresponding path program 1 times [2018-02-02 10:30:03,019 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:03,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:03,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:30:03,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,077 INFO L182 omatonBuilderFactory]: Interpolants [2470#true, 2471#false, 2472#(and (= 0 |main_#t~malloc12.offset|) (= 12 (select |#length| |main_#t~malloc12.base|))), 2473#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2474#(and (= |main_#t~mem14.offset| 0) (= (select |#length| |main_#t~mem14.base|) 12))] [2018-02-02 10:30:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:30:03,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:30:03,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:30:03,077 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-02-02 10:30:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:03,202 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-02-02 10:30:03,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:30:03,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:30:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:03,204 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:30:03,204 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:30:03,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:30:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:30:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:30:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-02-02 10:30:03,208 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 19 [2018-02-02 10:30:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:03,208 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-02-02 10:30:03,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:30:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-02-02 10:30:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:30:03,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:03,209 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:03,210 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1293732257, now seen corresponding path program 1 times [2018-02-02 10:30:03,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:03,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:03,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:03,319 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,319 INFO L182 omatonBuilderFactory]: Interpolants [2773#true, 2774#false, 2775#(= (select |#valid| main_~head~0.base) 1), 2776#(= (select |#valid| main_~x~0.base) 1), 2777#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~x~0.base |main_#t~malloc12.base|))), 2778#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 2779#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 2780#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2781#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:30:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:03,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:03,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:03,320 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 9 states. [2018-02-02 10:30:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:03,550 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 10:30:03,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:03,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:30:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:03,556 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:30:03,556 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:30:03,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:30:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:30:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-02-02 10:30:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:30:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-02-02 10:30:03,560 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 22 [2018-02-02 10:30:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:03,560 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-02-02 10:30:03,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-02-02 10:30:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:30:03,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:03,561 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:03,561 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1293732256, now seen corresponding path program 1 times [2018-02-02 10:30:03,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:03,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:03,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 10:30:03,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:03,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:03,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,712 INFO L182 omatonBuilderFactory]: Interpolants [3088#(= (select |#valid| main_~head~0.base) 1), 3089#(= (select |#valid| main_~x~0.base) 1), 3090#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= 12 (select |#length| |main_#t~malloc12.base|))), 3091#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3092#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3093#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3094#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12)), 3086#true, 3087#false] [2018-02-02 10:30:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:03,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:03,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:03,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:03,712 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 9 states. [2018-02-02 10:30:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:04,019 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 10:30:04,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:04,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:30:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:04,020 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:30:04,021 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:30:04,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:30:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:30:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 10:30:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:30:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-02-02 10:30:04,024 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 22 [2018-02-02 10:30:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:04,024 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-02-02 10:30:04,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-02-02 10:30:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:30:04,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:04,025 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:04,025 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:04,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1249497819, now seen corresponding path program 1 times [2018-02-02 10:30:04,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:04,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:04,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:30:04,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,177 INFO L182 omatonBuilderFactory]: Interpolants [3397#true, 3398#false, 3399#(= (select |#valid| main_~head~0.base) 1), 3400#(= (select |#valid| main_~x~0.base) 1), 3401#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 3402#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 3403#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 3404#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3405#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 10:30:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:04,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:04,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:04,178 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-02-02 10:30:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:04,479 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2018-02-02 10:30:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:30:04,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:30:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:04,481 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:30:04,481 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:30:04,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:30:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:30:04,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 10:30:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:30:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 10:30:04,484 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 22 [2018-02-02 10:30:04,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:04,485 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 10:30:04,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 10:30:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:30:04,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:04,485 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:04,486 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:04,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1249497820, now seen corresponding path program 1 times [2018-02-02 10:30:04,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:04,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:04,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:30:04,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,640 INFO L182 omatonBuilderFactory]: Interpolants [3712#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 3713#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 3704#true, 3705#false, 3706#(= (select |#valid| main_~head~0.base) 1), 3707#(= (select |#valid| main_~x~0.base) 1), 3708#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 3709#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3710#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3711#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:30:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:04,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:30:04,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:30:04,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:04,640 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 10 states. [2018-02-02 10:30:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:05,060 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-02 10:30:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:30:05,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:30:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:05,060 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:30:05,061 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:30:05,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:30:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2018-02-02 10:30:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:30:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 10:30:05,063 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 22 [2018-02-02 10:30:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:05,063 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 10:30:05,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:30:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 10:30:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:30:05,064 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:05,064 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:05,064 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1046747597, now seen corresponding path program 1 times [2018-02-02 10:30:05,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:05,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:05,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:05,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:30:05,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:05,313 INFO L182 omatonBuilderFactory]: Interpolants [4000#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 4001#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 4002#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4003#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|))), 4004#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4005#(or (and (= |main_#t~mem16.base| main_~head~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) main_~head~0.offset)) (not (= (+ |main_#t~mem16.offset| 8) main_~head~0.offset))) (and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem16.base| main_~head~0.base)))), 4006#(or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 4007#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4008#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4009#(or (and (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 1 (select |#valid| main_~x~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4010#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 4011#(= 1 (select |#valid| |main_#t~mem20.base|)), 4012#(= 1 (select |#valid| main_~x~0.base)), 3995#true, 3996#false, 3997#(= 0 |main_#t~malloc0.offset|), 3998#(= 0 main_~head~0.offset), 3999#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)))] [2018-02-02 10:30:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:05,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:30:05,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:30:05,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:30:05,314 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 18 states. [2018-02-02 10:30:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:05,978 INFO L93 Difference]: Finished difference Result 220 states and 230 transitions. [2018-02-02 10:30:05,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:30:05,978 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-02-02 10:30:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:05,979 INFO L225 Difference]: With dead ends: 220 [2018-02-02 10:30:05,979 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:30:05,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=1062, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:30:05,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:30:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 145. [2018-02-02 10:30:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:30:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-02 10:30:05,982 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 37 [2018-02-02 10:30:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:05,982 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-02 10:30:05,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:30:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-02 10:30:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:30:05,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:05,983 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:05,983 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1046747596, now seen corresponding path program 1 times [2018-02-02 10:30:05,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:05,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:06,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:30:06,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,205 INFO L182 omatonBuilderFactory]: Interpolants [4418#true, 4419#false, 4420#(= 1 (select |#valid| main_~head~0.base)), 4421#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 4422#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc12.base|)) (= main_~x~0.base main_~head~0.base)), 4423#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 4424#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem14.base|)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4425#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4426#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4427#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4428#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 4429#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 4430#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 4431#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:30:06,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:30:06,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:30:06,205 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 14 states. [2018-02-02 10:30:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:06,763 INFO L93 Difference]: Finished difference Result 245 states and 254 transitions. [2018-02-02 10:30:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:30:06,763 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-02 10:30:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:06,764 INFO L225 Difference]: With dead ends: 245 [2018-02-02 10:30:06,764 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 10:30:06,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:30:06,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 10:30:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 143. [2018-02-02 10:30:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:30:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 10:30:06,768 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 37 [2018-02-02 10:30:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:06,768 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 10:30:06,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:30:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 10:30:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:30:06,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:06,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:06,769 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1370950256, now seen corresponding path program 1 times [2018-02-02 10:30:06,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:06,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:06,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 10:30:06,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,962 INFO L182 omatonBuilderFactory]: Interpolants [4842#true, 4843#false, 4844#(= 0 |main_#t~malloc0.offset|), 4845#(= 0 main_~head~0.offset), 4846#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 4847#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4848#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 4849#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4850#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|))), 4851#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4852#(or (and (= |main_#t~mem16.base| main_~head~0.base) (= main_~head~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) main_~head~0.offset)) (not (= (+ |main_#t~mem16.offset| 8) main_~head~0.offset))) (and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem16.base| main_~head~0.base)))), 4853#(or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 4854#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4855#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4856#(= 1 (select |#valid| |main_#t~mem22.base|)), 4857#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:30:06,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:30:06,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:06,962 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 16 states. [2018-02-02 10:30:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:07,478 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2018-02-02 10:30:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:30:07,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-02 10:30:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:07,479 INFO L225 Difference]: With dead ends: 233 [2018-02-02 10:30:07,479 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:30:07,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:30:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:30:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 151. [2018-02-02 10:30:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:30:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-02-02 10:30:07,485 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 37 [2018-02-02 10:30:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:07,485 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-02-02 10:30:07,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:30:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-02-02 10:30:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:30:07,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:07,486 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:07,486 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:07,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1370950257, now seen corresponding path program 1 times [2018-02-02 10:30:07,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:07,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:07,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:07,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:30:07,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:07,648 INFO L182 omatonBuilderFactory]: Interpolants [5280#(= (select |#valid| main_~head~0.base) 1), 5281#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5282#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc12.base|)) (= main_~x~0.base main_~head~0.base)), 5283#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5284#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem14.base|)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5285#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5286#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5287#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5288#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 5289#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 5278#true, 5279#false] [2018-02-02 10:30:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:07,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:30:07,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:30:07,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:30:07,648 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 12 states. [2018-02-02 10:30:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:08,078 INFO L93 Difference]: Finished difference Result 248 states and 257 transitions. [2018-02-02 10:30:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:30:08,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-02-02 10:30:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:08,080 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:30:08,080 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:30:08,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:30:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 151. [2018-02-02 10:30:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:30:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:30:08,083 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 37 [2018-02-02 10:30:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:08,083 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:30:08,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:30:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:30:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:30:08,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:08,086 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:08,086 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2032889175, now seen corresponding path program 2 times [2018-02-02 10:30:08,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:08,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:08,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:08,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,354 INFO L182 omatonBuilderFactory]: Interpolants [5707#true, 5708#false, 5709#(= 0 |main_#t~malloc0.offset|), 5710#(= main_~head~0.offset 0), 5711#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 5712#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 5713#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 5714#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 5715#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|)) (= main_~head~0.offset 0) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5716#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| 0) (not (= |main_#t~mem16.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5717#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 2) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5718#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5719#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 5720#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 5721#(and (= 0 |main_#t~mem20.offset|) (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 8)) 2)), 5722#(or (<= (+ main_~x~0.offset 1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)), 5723#(or (<= (+ main_~x~0.offset 1) 0) (= |main_#t~mem19| 2)), 5724#(<= (+ main_~x~0.offset 1) 0)] [2018-02-02 10:30:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:30:08,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:30:08,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:30:08,355 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 18 states. [2018-02-02 10:30:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:08,999 INFO L93 Difference]: Finished difference Result 225 states and 232 transitions. [2018-02-02 10:30:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:30:09,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-02-02 10:30:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:09,000 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:30:09,001 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 10:30:09,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=1033, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:30:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 10:30:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 154. [2018-02-02 10:30:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:30:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2018-02-02 10:30:09,003 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 46 [2018-02-02 10:30:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:09,003 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2018-02-02 10:30:09,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:30:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2018-02-02 10:30:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:30:09,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:09,003 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:09,004 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 384808678, now seen corresponding path program 1 times [2018-02-02 10:30:09,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:09,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:09,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:09,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:09,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:09,234 INFO L182 omatonBuilderFactory]: Interpolants [6144#(= 0 |main_#t~malloc0.offset|), 6145#(= main_~head~0.offset 0), 6146#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 6147#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 6148#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 6149#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0)), 6150#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|)) (= main_~head~0.offset 0) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6151#(and (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem16.offset| 0) (not (= |main_#t~mem16.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6152#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (+ main_~head~0.offset 8)) 2) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6153#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6154#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6155#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 6156#(and (= 0 |main_#t~mem20.offset|) (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 8)) 2)), 6157#(or (<= (+ main_~x~0.offset 1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)), 6158#(or (<= (+ main_~x~0.offset 1) 0) (and (= |main_#t~mem18| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2))), 6159#(<= (+ main_~x~0.offset 1) 0), 6142#true, 6143#false] [2018-02-02 10:30:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:09,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:30:09,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:30:09,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:30:09,235 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand 18 states. [2018-02-02 10:30:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:09,854 INFO L93 Difference]: Finished difference Result 215 states and 221 transitions. [2018-02-02 10:30:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:30:09,855 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-02-02 10:30:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:09,855 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:30:09,855 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:30:09,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=1036, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:30:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:30:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 145. [2018-02-02 10:30:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:30:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-02-02 10:30:09,858 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 46 [2018-02-02 10:30:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:09,858 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-02-02 10:30:09,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:30:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-02-02 10:30:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:30:09,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:09,859 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:09,859 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1950459154, now seen corresponding path program 1 times [2018-02-02 10:30:09,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:09,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:10,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:10,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,059 INFO L182 omatonBuilderFactory]: Interpolants [6560#(not (= 0 |main_#t~malloc0.base|)), 6561#(not (= 0 main_~head~0.base)), 6562#(and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base))), 6563#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 6564#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 6565#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 6566#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem14.base|)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6567#(and (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 6568#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 6569#(and (not (= main_~head~0.base |main_#t~mem22.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.base|) (not (= 0 main_~head~0.base))), 6570#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 6571#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 6572#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base))), 6573#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base))), 6574#(and (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)) (not (= 0 main_~head~0.base))), 6575#(and (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= 0 main_~head~0.base))), 6576#(= 1 (select |#valid| main_~x~0.base)), 6558#true, 6559#false] [2018-02-02 10:30:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:30:10,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:30:10,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:10,060 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 19 states. [2018-02-02 10:30:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:10,754 INFO L93 Difference]: Finished difference Result 222 states and 228 transitions. [2018-02-02 10:30:10,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:30:10,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 10:30:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:10,755 INFO L225 Difference]: With dead ends: 222 [2018-02-02 10:30:10,755 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 10:30:10,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:30:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 10:30:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 156. [2018-02-02 10:30:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:30:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2018-02-02 10:30:10,757 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 48 [2018-02-02 10:30:10,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:10,757 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2018-02-02 10:30:10,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:30:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2018-02-02 10:30:10,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:30:10,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:10,758 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:10,758 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1950459153, now seen corresponding path program 1 times [2018-02-02 10:30:10,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:10,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:10,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:30:10,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,846 INFO L182 omatonBuilderFactory]: Interpolants [6997#true, 6998#false, 6999#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7000#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7001#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7002#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8))), 7003#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7004#(and (<= (+ |main_#t~mem25.offset| 12) (select |#length| |main_#t~mem25.base|)) (<= 0 (+ |main_#t~mem25.offset| 8))), 7005#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8)))] [2018-02-02 10:30:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:10,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:10,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:10,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:10,847 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand 9 states. [2018-02-02 10:30:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:11,222 INFO L93 Difference]: Finished difference Result 215 states and 220 transitions. [2018-02-02 10:30:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:30:11,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-02-02 10:30:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:11,223 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:30:11,223 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:30:11,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:11,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:30:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 167. [2018-02-02 10:30:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:30:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-02-02 10:30:11,225 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 48 [2018-02-02 10:30:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:11,226 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-02-02 10:30:11,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-02-02 10:30:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:30:11,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:11,227 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:11,227 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1756403259, now seen corresponding path program 1 times [2018-02-02 10:30:11,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:11,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:11,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:30:11,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,403 INFO L182 omatonBuilderFactory]: Interpolants [7403#true, 7404#false, 7405#(= 0 |main_#t~malloc0.offset|), 7406#(= 0 main_~head~0.offset), 7407#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 7408#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7409#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 7410#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7411#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|))), 7412#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7413#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) main_~head~0.offset)) (= |main_#t~mem16.base| main_~head~0.base) (not (= (+ |main_#t~mem16.offset| 8) main_~head~0.offset))) (and (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7414#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 7415#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 7416#(= 0 |main_#t~mem27.offset|)] [2018-02-02 10:30:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:30:11,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:30:11,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:30:11,404 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 14 states. [2018-02-02 10:30:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:11,754 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-02-02 10:30:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:30:11,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-02-02 10:30:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:11,755 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:30:11,755 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:30:11,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:30:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:30:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2018-02-02 10:30:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:30:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-02-02 10:30:11,757 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 49 [2018-02-02 10:30:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:11,757 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-02-02 10:30:11,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:30:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-02-02 10:30:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:30:11,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:11,758 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:11,758 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1756403258, now seen corresponding path program 1 times [2018-02-02 10:30:11,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:11,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:11,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:30:11,812 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,813 INFO L182 omatonBuilderFactory]: Interpolants [7827#true, 7828#false, 7829#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7830#(= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 7831#(= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)), 7832#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7833#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7834#(= 1 (select |#valid| |main_#t~mem27.base|))] [2018-02-02 10:30:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:11,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:30:11,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:30:11,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:11,814 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 8 states. [2018-02-02 10:30:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:11,991 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2018-02-02 10:30:11,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:30:11,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 10:30:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:11,991 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:30:11,991 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 10:30:11,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:30:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 10:30:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2018-02-02 10:30:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:30:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-02-02 10:30:11,993 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 49 [2018-02-02 10:30:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:11,993 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-02-02 10:30:11,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:30:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-02-02 10:30:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:30:11,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:11,994 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:11,994 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1785500528, now seen corresponding path program 1 times [2018-02-02 10:30:11,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:12,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:12,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:12,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:12,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:12,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 10:30:12,255 INFO L182 omatonBuilderFactory]: Interpolants [8224#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 8225#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8226#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem14.base|))), 8227#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8228#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) main_~head~0.offset)) (= |main_#t~mem16.base| main_~head~0.base) (not (= (+ |main_#t~mem16.offset| 8) main_~head~0.offset))) (and (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8229#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8230#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8231#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8232#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8233#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 8234#(= 0 |main_#t~mem25.offset|), 8235#(= main_~x~0.offset 0), 8236#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 8218#true, 8219#false, 8220#(= 0 |main_#t~malloc0.offset|), 8221#(= 0 main_~head~0.offset), 8222#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 8223#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:30:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:12,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:30:12,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:30:12,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:12,256 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 19 states. [2018-02-02 10:30:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:12,799 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2018-02-02 10:30:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:30:12,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-02-02 10:30:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:12,800 INFO L225 Difference]: With dead ends: 217 [2018-02-02 10:30:12,800 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:30:12,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:30:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:30:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 177. [2018-02-02 10:30:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:30:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2018-02-02 10:30:12,803 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 50 [2018-02-02 10:30:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:12,803 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2018-02-02 10:30:12,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:30:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2018-02-02 10:30:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:30:12,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:12,804 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:12,804 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:12,804 INFO L82 PathProgramCache]: Analyzing trace with hash 18622023, now seen corresponding path program 1 times [2018-02-02 10:30:12,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:12,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:12,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:12,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:30:12,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:12,961 INFO L182 omatonBuilderFactory]: Interpolants [8672#false, 8673#(= (select |#valid| main_~head~0.base) 1), 8674#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8675#(and (not (= 0 |main_#t~malloc12.base|)) (not (= main_~x~0.base |main_#t~malloc12.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 8676#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 8677#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem14.base|)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8678#(and (= 1 (select |#valid| main_~head~0.base)) (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 8679#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 8680#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 8681#(and (= 1 (select (store |#valid| |main_#t~mem27.base| 0) main_~x~0.base)) (not (= 0 |main_#t~mem27.base|))), 8682#(= 1 (select |#valid| main_~x~0.base)), 8671#true] [2018-02-02 10:30:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:12,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:30:12,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:30:12,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:30:12,962 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand 12 states. [2018-02-02 10:30:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:13,291 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-02-02 10:30:13,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:30:13,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-02-02 10:30:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:13,292 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:30:13,292 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:30:13,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:30:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 179. [2018-02-02 10:30:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:30:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-02-02 10:30:13,295 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 51 [2018-02-02 10:30:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:13,295 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-02-02 10:30:13,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:30:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-02-02 10:30:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:30:13,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:13,295 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:13,295 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:13,296 INFO L82 PathProgramCache]: Analyzing trace with hash 405927113, now seen corresponding path program 1 times [2018-02-02 10:30:13,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:13,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:13,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:13,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:30:13,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:13,670 INFO L182 omatonBuilderFactory]: Interpolants [9088#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 9089#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 9090#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 9091#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9092#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9093#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 9094#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 9095#(= 1 (select |#valid| |main_#t~mem20.base|)), 9096#(= 1 (select |#valid| main_~x~0.base)), 9076#true, 9077#false, 9078#(= 1 (select |#valid| main_~head~0.base)), 9079#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9080#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9081#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9082#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9083#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 9084#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 9085#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 9086#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))), 9087#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 10:30:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:13,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:30:13,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:30:13,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:13,671 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 21 states. [2018-02-02 10:30:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:14,590 INFO L93 Difference]: Finished difference Result 300 states and 323 transitions. [2018-02-02 10:30:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:30:14,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-02 10:30:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:14,592 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:30:14,592 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:30:14,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:30:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:30:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 216. [2018-02-02 10:30:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:30:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions. [2018-02-02 10:30:14,597 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 51 [2018-02-02 10:30:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:14,597 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions. [2018-02-02 10:30:14,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:30:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions. [2018-02-02 10:30:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:30:14,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:14,597 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:14,597 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 405927114, now seen corresponding path program 1 times [2018-02-02 10:30:14,598 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:14,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:15,120 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 42 DAG size of output 36 [2018-02-02 10:30:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:15,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:15,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:30:15,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:15,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 10:30:15,328 INFO L182 omatonBuilderFactory]: Interpolants [9664#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9665#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 9666#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 9667#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 9668#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 9669#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 9649#true, 9650#false, 9651#(= 1 (select |#valid| main_~head~0.base)), 9652#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9653#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 9654#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 9655#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 9656#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9657#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)), 9658#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 9659#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 9660#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9661#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 9662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9663#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:30:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:15,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:30:15,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:30:15,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:30:15,328 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand 21 states. [2018-02-02 10:30:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:16,136 INFO L93 Difference]: Finished difference Result 344 states and 368 transitions. [2018-02-02 10:30:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:30:16,136 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-02 10:30:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:16,137 INFO L225 Difference]: With dead ends: 344 [2018-02-02 10:30:16,137 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 10:30:16,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:30:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 10:30:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 222. [2018-02-02 10:30:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:30:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 239 transitions. [2018-02-02 10:30:16,141 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 239 transitions. Word has length 51 [2018-02-02 10:30:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:16,141 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 239 transitions. [2018-02-02 10:30:16,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:30:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 239 transitions. [2018-02-02 10:30:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:30:16,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:16,142 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:16,142 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1471342330, now seen corresponding path program 1 times [2018-02-02 10:30:16,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:16,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:16,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:16,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:16,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:16,351 INFO L182 omatonBuilderFactory]: Interpolants [10272#(= (select |#valid| main_~head~0.base) 1), 10273#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10274#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10275#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10276#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 10277#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 10278#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 10279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 10280#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))), 10281#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 10282#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 10283#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 10284#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 10285#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10286#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10287#(= 1 (select |#valid| |main_#t~mem22.base|)), 10288#(= 1 (select |#valid| main_~x~0.base)), 10270#true, 10271#false] [2018-02-02 10:30:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:16,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:30:16,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:30:16,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:16,352 INFO L87 Difference]: Start difference. First operand 222 states and 239 transitions. Second operand 19 states. [2018-02-02 10:30:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:17,129 INFO L93 Difference]: Finished difference Result 311 states and 333 transitions. [2018-02-02 10:30:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:30:17,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:30:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:17,130 INFO L225 Difference]: With dead ends: 311 [2018-02-02 10:30:17,130 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 10:30:17,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:30:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 10:30:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 230. [2018-02-02 10:30:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:30:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 248 transitions. [2018-02-02 10:30:17,135 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 248 transitions. Word has length 51 [2018-02-02 10:30:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:17,135 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 248 transitions. [2018-02-02 10:30:17,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:30:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 248 transitions. [2018-02-02 10:30:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:30:17,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:17,136 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:17,136 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1471342329, now seen corresponding path program 1 times [2018-02-02 10:30:17,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:17,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:17,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:17,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:30:17,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:17,588 INFO L182 omatonBuilderFactory]: Interpolants [10860#true, 10861#false, 10862#(= (select |#valid| main_~head~0.base) 1), 10863#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10864#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 10865#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 10866#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 10867#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10868#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)), 10869#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 10870#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 10871#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10872#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 10873#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10874#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10875#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10876#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10877#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 10878#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:17,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:30:17,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:30:17,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:30:17,589 INFO L87 Difference]: Start difference. First operand 230 states and 248 transitions. Second operand 19 states. [2018-02-02 10:30:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:18,430 INFO L93 Difference]: Finished difference Result 342 states and 364 transitions. [2018-02-02 10:30:18,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:30:18,430 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 10:30:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:18,431 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:30:18,431 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:30:18,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:30:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:30:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 230. [2018-02-02 10:30:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:30:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-02-02 10:30:18,434 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 51 [2018-02-02 10:30:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:18,434 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-02-02 10:30:18,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:30:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-02-02 10:30:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:30:18,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:18,435 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:18,435 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 715900679, now seen corresponding path program 1 times [2018-02-02 10:30:18,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:18,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:18,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:18,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:30:18,934 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:18,934 INFO L182 omatonBuilderFactory]: Interpolants [11488#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)), 11489#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)), 11490#(and (or (and (= |main_#t~mem16.base| main_~head~0.base) (not (= (+ |main_#t~mem16.offset| 8) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) main_~head~0.offset) main_~head~0.base)) (and (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|))) (not (= 0 main_~head~0.base))), 11491#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) |old(#valid)|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= 0 main_~head~0.base))), 11492#(and (or (and (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) 0) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.base)) (not (= 0 main_~head~0.base))), 11493#(and (not (= 0 main_~x~0.base)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 11494#(and (or (and (= |old(#valid)| (store (store |#valid| |main_#t~mem27.base| 0) main_~x~0.base 0)) (not (= 0 |main_#t~mem27.base|))) (= |main_#t~mem27.base| main_~x~0.base)) (not (= 0 main_~x~0.base))), 11495#(and (not (= 0 main_~x~0.base)) (or (= 0 (select |#valid| main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|))), 11479#true, 11480#false, 11481#(= |#valid| |old(#valid)|), 11482#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 11483#(and (= 0 main_~head~0.offset) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 11484#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|)), 11485#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (= (store |#valid| main_~head~0.base 0) |old(#valid)|) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11486#(and (not (= 0 |main_#t~malloc12.base|)) (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~head~0.base 0) |main_#t~malloc12.base| 0)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 11487#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset 0) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (store (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|))] [2018-02-02 10:30:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:18,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:30:18,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:30:18,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:30:18,935 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 17 states. [2018-02-02 10:30:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:19,526 INFO L93 Difference]: Finished difference Result 243 states and 260 transitions. [2018-02-02 10:30:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:30:19,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 10:30:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:19,527 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:30:19,528 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 10:30:19,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:30:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 10:30:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 222. [2018-02-02 10:30:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 10:30:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 238 transitions. [2018-02-02 10:30:19,532 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 238 transitions. Word has length 53 [2018-02-02 10:30:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:19,532 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 238 transitions. [2018-02-02 10:30:19,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:30:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 238 transitions. [2018-02-02 10:30:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:30:19,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:19,533 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:19,533 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1909599630, now seen corresponding path program 2 times [2018-02-02 10:30:19,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:19,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:30:19,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:19,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:30:19,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:19,658 INFO L182 omatonBuilderFactory]: Interpolants [11984#false, 11985#(= 0 |main_#t~malloc0.offset|), 11986#(= main_~head~0.offset 0), 11987#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 11988#(and (= main_~head~0.offset main_~x~0.offset) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem18|) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 11989#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 11990#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 11991#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0)), 11992#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= |main_#t~mem24| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0)), 11983#true] [2018-02-02 10:30:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:30:19,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:30:19,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:30:19,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:19,658 INFO L87 Difference]: Start difference. First operand 222 states and 238 transitions. Second operand 10 states. [2018-02-02 10:30:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:19,836 INFO L93 Difference]: Finished difference Result 235 states and 240 transitions. [2018-02-02 10:30:19,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:30:19,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-02 10:30:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:19,837 INFO L225 Difference]: With dead ends: 235 [2018-02-02 10:30:19,837 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 10:30:19,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:30:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 10:30:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 185. [2018-02-02 10:30:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:30:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-02-02 10:30:19,840 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 54 [2018-02-02 10:30:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:19,840 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-02-02 10:30:19,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:30:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-02-02 10:30:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:19,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:19,840 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] [2018-02-02 10:30:19,840 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1614187731, now seen corresponding path program 2 times [2018-02-02 10:30:19,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:19,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:20,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:20,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:30:20,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:20,246 INFO L182 omatonBuilderFactory]: Interpolants [12425#true, 12426#false, 12427#(= 1 (select |#valid| main_~head~0.base)), 12428#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12429#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12430#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12431#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 12432#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 12433#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 12434#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 12435#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 12436#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 12437#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 12438#(and (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 12439#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12440#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 12441#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))))), 12442#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem19|))), 12443#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 12444#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12445#(= 1 (select |#valid| |main_#t~mem20.base|)), 12446#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:20,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:30:20,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:30:20,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:30:20,246 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 22 states. [2018-02-02 10:30:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:21,096 INFO L93 Difference]: Finished difference Result 257 states and 271 transitions. [2018-02-02 10:30:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:30:21,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-02-02 10:30:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:21,097 INFO L225 Difference]: With dead ends: 257 [2018-02-02 10:30:21,097 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 10:30:21,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:30:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 10:30:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 193. [2018-02-02 10:30:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 10:30:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2018-02-02 10:30:21,101 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 60 [2018-02-02 10:30:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:21,101 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2018-02-02 10:30:21,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:30:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2018-02-02 10:30:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:21,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:21,102 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] [2018-02-02 10:30:21,102 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1614187732, now seen corresponding path program 2 times [2018-02-02 10:30:21,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:21,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:21,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:21,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:30:21,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:21,622 INFO L182 omatonBuilderFactory]: Interpolants [12933#true, 12934#false, 12935#(= 1 (select |#valid| main_~head~0.base)), 12936#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12937#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12938#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12939#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 12940#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 12941#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 12942#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 12943#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= 12 (select |#length| |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 12944#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12945#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 12946#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 12947#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 12948#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 12949#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 12950#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not (= 0 |main_#t~mem19|))), 12951#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 12952#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 12953#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 12954#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:21,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:30:21,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:30:21,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:30:21,623 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand 22 states. [2018-02-02 10:30:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:22,643 INFO L93 Difference]: Finished difference Result 296 states and 310 transitions. [2018-02-02 10:30:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:30:22,643 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-02-02 10:30:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:22,644 INFO L225 Difference]: With dead ends: 296 [2018-02-02 10:30:22,644 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 10:30:22,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:30:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 10:30:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 194. [2018-02-02 10:30:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:30:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 208 transitions. [2018-02-02 10:30:22,646 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 208 transitions. Word has length 60 [2018-02-02 10:30:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:22,647 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 208 transitions. [2018-02-02 10:30:22,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:30:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 208 transitions. [2018-02-02 10:30:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:22,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:22,647 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] [2018-02-02 10:30:22,647 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash -263081712, now seen corresponding path program 1 times [2018-02-02 10:30:22,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:22,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:23,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:23,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:30:23,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:23,026 INFO L182 omatonBuilderFactory]: Interpolants [13481#true, 13482#false, 13483#(= 1 (select |#valid| main_~head~0.base)), 13484#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 13485#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 13486#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 13487#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 13488#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 13489#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 13490#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 13491#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 13492#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13493#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 13494#(and (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 13495#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 13496#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 13497#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))))), 13498#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem19|))), 13499#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 13500#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13501#(= 1 (select |#valid| |main_#t~mem22.base|)), 13502#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:23,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:30:23,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:30:23,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:30:23,037 INFO L87 Difference]: Start difference. First operand 194 states and 208 transitions. Second operand 22 states. [2018-02-02 10:30:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:23,836 INFO L93 Difference]: Finished difference Result 270 states and 285 transitions. [2018-02-02 10:30:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:30:23,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-02-02 10:30:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:23,837 INFO L225 Difference]: With dead ends: 270 [2018-02-02 10:30:23,837 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 10:30:23,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:30:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 10:30:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 202. [2018-02-02 10:30:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:30:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2018-02-02 10:30:23,840 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 60 [2018-02-02 10:30:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:23,841 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2018-02-02 10:30:23,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:30:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2018-02-02 10:30:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:30:23,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:23,842 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] [2018-02-02 10:30:23,842 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -263081711, now seen corresponding path program 1 times [2018-02-02 10:30:23,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:23,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:24,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:24,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:30:24,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:24,251 INFO L182 omatonBuilderFactory]: Interpolants [14016#false, 14017#(= 1 (select |#valid| main_~head~0.base)), 14018#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 14019#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 14020#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 14021#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 14022#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 14023#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 14024#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 14025#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= 12 (select |#length| |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 14026#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 14027#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 14028#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 14029#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 14030#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 14031#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 14032#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not (= 0 |main_#t~mem19|))), 14033#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 14034#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14035#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 14036#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 14015#true] [2018-02-02 10:30:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:24,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:30:24,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:30:24,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:30:24,252 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand 22 states. [2018-02-02 10:30:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:25,214 INFO L93 Difference]: Finished difference Result 299 states and 313 transitions. [2018-02-02 10:30:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:30:25,215 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-02-02 10:30:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:25,215 INFO L225 Difference]: With dead ends: 299 [2018-02-02 10:30:25,215 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 10:30:25,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:30:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 10:30:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 202. [2018-02-02 10:30:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-02-02 10:30:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2018-02-02 10:30:25,219 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 60 [2018-02-02 10:30:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:25,219 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2018-02-02 10:30:25,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:30:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2018-02-02 10:30:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:30:25,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:25,220 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:25,220 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1475983525, now seen corresponding path program 1 times [2018-02-02 10:30:25,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:25,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:25,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:25,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:30:25,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:25,610 INFO L182 omatonBuilderFactory]: Interpolants [14592#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 14593#(= 0 |main_#t~mem27.offset|), 14574#true, 14575#false, 14576#(= 0 |main_#t~malloc0.offset|), 14577#(= 0 main_~head~0.offset), 14578#(and (= 0 main_~head~0.offset) (= (select |#valid| main_~head~0.base) 1)), 14579#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 14580#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base) (= 0 main_~x~0.offset)), 14581#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 main_~x~0.offset)), 14582#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 main_~x~0.offset)), 14583#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 14584#(and (or (and (or (<= 1 main_~x~0.offset) (<= (+ main_~x~0.offset 1) 0)) (= (select |#length| main_~x~0.base) 12)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 14585#(and (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (or (and (<= (+ main_~x~0.offset 1) 0) (= (select |#length| main_~x~0.base) 12)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 14586#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (or (<= (+ main_~x~0.offset 1) 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))), 14587#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14588#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 14589#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14590#(and (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14591#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))] [2018-02-02 10:30:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:25,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:30:25,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:30:25,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:30:25,611 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand 20 states. [2018-02-02 10:30:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:26,334 INFO L93 Difference]: Finished difference Result 292 states and 305 transitions. [2018-02-02 10:30:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:30:26,334 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-02-02 10:30:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:26,335 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:30:26,335 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:30:26,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1544, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:30:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:30:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 248. [2018-02-02 10:30:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:30:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 271 transitions. [2018-02-02 10:30:26,338 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 271 transitions. Word has length 63 [2018-02-02 10:30:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:26,338 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 271 transitions. [2018-02-02 10:30:26,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:30:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 271 transitions. [2018-02-02 10:30:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:30:26,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:26,338 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:26,338 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:26,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1080953251, now seen corresponding path program 1 times [2018-02-02 10:30:26,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:26,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:26,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:26,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:30:26,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:26,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 10:30:26,901 INFO L182 omatonBuilderFactory]: Interpolants [15200#(and (or (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| main_~head~0.base))), 15201#(and (= 1 (select |#valid| main_~x~0.base)) (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 15202#(and (= 1 (select |#valid| main_~x~0.base)) (or (= 1 (select (store |#valid| |main_#t~mem27.base| 0) main_~x~0.base)) (not (= 0 |main_#t~mem27.offset|)))), 15203#(= 1 (select |#valid| main_~x~0.base)), 15182#true, 15183#false, 15184#(= 0 |main_#t~malloc0.offset|), 15185#(= 0 main_~head~0.offset), 15186#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 15187#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 15188#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 15189#(or (<= (+ main_~x~0.offset 1) 0) (and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))), 15190#(and (or (<= (+ main_~x~0.offset 1) 0) (and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base))) (= (select |#valid| main_~x~0.base) 1)), 15191#(and (or (<= (+ main_~x~0.offset 1) 0) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)))) (= (select |#valid| main_~x~0.base) 1)), 15192#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (or (<= (+ main_~x~0.offset 1) 0) (and (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))) (and (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)))))), 15193#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15194#(and (or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))) (and (not (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (not (= main_~x~0.base |main_#t~mem14.base|))), 15195#(or (and (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 15196#(or (and (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (and (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 15197#(or (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 15198#(and (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)))) (= main_~x~0.base main_~head~0.base)), 15199#(and (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)))) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:30:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:26,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:30:26,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:30:26,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:30:26,901 INFO L87 Difference]: Start difference. First operand 248 states and 271 transitions. Second operand 22 states. [2018-02-02 10:30:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:28,053 INFO L93 Difference]: Finished difference Result 298 states and 309 transitions. [2018-02-02 10:30:28,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:30:28,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-02-02 10:30:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:28,054 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:30:28,054 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:30:28,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=1657, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:30:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:30:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2018-02-02 10:30:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:30:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 273 transitions. [2018-02-02 10:30:28,059 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 273 transitions. Word has length 65 [2018-02-02 10:30:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:28,059 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 273 transitions. [2018-02-02 10:30:28,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:30:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 273 transitions. [2018-02-02 10:30:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:30:28,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:28,060 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:28,060 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash -693648161, now seen corresponding path program 3 times [2018-02-02 10:30:28,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:28,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:28,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:28,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:30:28,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:28,634 INFO L182 omatonBuilderFactory]: Interpolants [15808#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 15809#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 15810#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base))), 15811#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15812#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 15813#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15814#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 15815#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 15816#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 15817#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)))), 15818#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15819#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 15820#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15821#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 15822#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 15823#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15824#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15825#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 15826#(= 1 (select |#valid| |main_#t~mem20.base|)), 15827#(= 1 (select |#valid| main_~x~0.base)), 15800#true, 15801#false, 15802#(= 1 (select |#valid| main_~head~0.base)), 15803#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 15804#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 15805#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 15806#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 15807#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)))] [2018-02-02 10:30:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:28,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:30:28,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:30:28,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:30:28,635 INFO L87 Difference]: Start difference. First operand 250 states and 273 transitions. Second operand 28 states. [2018-02-02 10:30:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:29,969 INFO L93 Difference]: Finished difference Result 359 states and 387 transitions. [2018-02-02 10:30:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 10:30:29,969 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-02-02 10:30:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:29,970 INFO L225 Difference]: With dead ends: 359 [2018-02-02 10:30:29,970 INFO L226 Difference]: Without dead ends: 359 [2018-02-02 10:30:29,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=627, Invalid=2913, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:30:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-02 10:30:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 287. [2018-02-02 10:30:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-02-02 10:30:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2018-02-02 10:30:29,973 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 65 [2018-02-02 10:30:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:29,973 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2018-02-02 10:30:29,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:30:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2018-02-02 10:30:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:30:29,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:29,974 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:29,974 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -693648160, now seen corresponding path program 3 times [2018-02-02 10:30:29,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:29,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,491 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:30,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:30:30,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,491 INFO L182 omatonBuilderFactory]: Interpolants [16538#true, 16539#false, 16540#(= 1 (select |#valid| main_~head~0.base)), 16541#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 16542#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 16543#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 16544#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 16545#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16546#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16547#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16548#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 16549#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16550#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 16551#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16552#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16553#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16554#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 16555#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 16556#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16557#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 16558#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16559#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16560#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16561#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 16562#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 16563#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~mem19|))), 16564#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 16565#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:30,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:30:30,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:30:30,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:30:30,492 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand 28 states. [2018-02-02 10:30:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:32,002 INFO L93 Difference]: Finished difference Result 331 states and 353 transitions. [2018-02-02 10:30:32,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:30:32,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-02-02 10:30:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:32,003 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:30:32,003 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:30:32,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=558, Invalid=2982, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:30:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:30:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 301. [2018-02-02 10:30:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 10:30:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 328 transitions. [2018-02-02 10:30:32,007 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 328 transitions. Word has length 65 [2018-02-02 10:30:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:32,007 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 328 transitions. [2018-02-02 10:30:32,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:30:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 328 transitions. [2018-02-02 10:30:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:30:32,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:32,008 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:32,008 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1724049692, now seen corresponding path program 2 times [2018-02-02 10:30:32,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:32,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:32,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:30:32,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,456 INFO L182 omatonBuilderFactory]: Interpolants [17280#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17281#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 17282#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17283#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 17284#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 17285#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17286#(= 1 (select |#valid| |main_#t~mem22.base|)), 17287#(= 1 (select |#valid| main_~x~0.base)), 17262#true, 17263#false, 17264#(= (select |#valid| main_~head~0.base) 1), 17265#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17266#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 17267#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 17268#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 17269#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 17270#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 17271#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 17272#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 17273#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17274#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 17275#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17276#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1)), 17277#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 17278#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 17279#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:30:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:32,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:32,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:32,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:32,457 INFO L87 Difference]: Start difference. First operand 301 states and 328 transitions. Second operand 26 states. [2018-02-02 10:30:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:33,376 INFO L93 Difference]: Finished difference Result 383 states and 412 transitions. [2018-02-02 10:30:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:30:33,376 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-02-02 10:30:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:33,377 INFO L225 Difference]: With dead ends: 383 [2018-02-02 10:30:33,377 INFO L226 Difference]: Without dead ends: 383 [2018-02-02 10:30:33,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=557, Invalid=2413, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:30:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-02 10:30:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 309. [2018-02-02 10:30:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 10:30:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 337 transitions. [2018-02-02 10:30:33,380 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 337 transitions. Word has length 65 [2018-02-02 10:30:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:33,380 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 337 transitions. [2018-02-02 10:30:33,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 337 transitions. [2018-02-02 10:30:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:30:33,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:33,380 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:33,380 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1724049693, now seen corresponding path program 2 times [2018-02-02 10:30:33,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:33,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:33,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:30:33,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,885 INFO L182 omatonBuilderFactory]: Interpolants [18048#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 18049#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18050#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 18051#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18052#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18053#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18054#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 18055#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 18056#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18057#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 18058#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18059#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18060#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18061#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18062#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 18063#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 18038#true, 18039#false, 18040#(= (select |#valid| main_~head~0.base) 1), 18041#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18042#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 18043#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 18044#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 18045#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18046#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18047#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1))] [2018-02-02 10:30:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:33,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:33,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:33,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:33,885 INFO L87 Difference]: Start difference. First operand 309 states and 337 transitions. Second operand 26 states. [2018-02-02 10:30:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:35,147 INFO L93 Difference]: Finished difference Result 337 states and 358 transitions. [2018-02-02 10:30:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:30:35,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 65 [2018-02-02 10:30:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:35,148 INFO L225 Difference]: With dead ends: 337 [2018-02-02 10:30:35,148 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 10:30:35,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=521, Invalid=2559, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:30:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 10:30:35,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 309. [2018-02-02 10:30:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 10:30:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 335 transitions. [2018-02-02 10:30:35,151 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 335 transitions. Word has length 65 [2018-02-02 10:30:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:35,151 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 335 transitions. [2018-02-02 10:30:35,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 335 transitions. [2018-02-02 10:30:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:30:35,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:35,152 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:35,152 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:35,152 INFO L82 PathProgramCache]: Analyzing trace with hash 586017181, now seen corresponding path program 1 times [2018-02-02 10:30:35,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:35,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:35,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:35,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:30:35,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:35,661 INFO L182 omatonBuilderFactory]: Interpolants [18784#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)))), 18785#(and (not (= |main_#t~mem14.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (not (= main_~x~0.base |main_#t~mem14.base|))), 18786#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)))), 18787#(= 0 (select (select (store |#memory_int| |main_#t~mem16.base| (store (select |#memory_int| |main_#t~mem16.base|) (+ |main_#t~mem16.offset| 8) 2)) main_~head~0.base) (+ main_~head~0.offset 8))), 18788#(= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))), 18789#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (= main_~x~0.base main_~head~0.base)), 18790#(or (not (= 1 (select |#valid| main_~x~0.base))) (not (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)) (select |#valid| main_~x~0.base)))), 18791#(not (= (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)) 1)), 18792#(not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 1)), 18793#(not (= |main_#t~mem24| 1)), 18770#true, 18771#false, 18772#(= 0 |main_#t~malloc0.offset|), 18773#(= main_~head~0.offset 0), 18774#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 18775#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 18776#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base)), 18777#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base)), 18778#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base)), 18779#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~head~0.offset 8))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (< main_~x~0.offset (+ main_~head~0.offset 1)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 18780#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8)))), 18781#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) 0)) main_~head~0.base) (+ main_~head~0.offset 8)))), 18782#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8) 1)) main_~head~0.base) (+ main_~head~0.offset 8)))), 18783#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= |main_#t~malloc12.base| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))] [2018-02-02 10:30:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:35,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:30:35,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:30:35,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:30:35,662 INFO L87 Difference]: Start difference. First operand 309 states and 335 transitions. Second operand 24 states. [2018-02-02 10:30:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:36,338 INFO L93 Difference]: Finished difference Result 327 states and 342 transitions. [2018-02-02 10:30:36,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:30:36,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-02-02 10:30:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:36,339 INFO L225 Difference]: With dead ends: 327 [2018-02-02 10:30:36,339 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 10:30:36,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=508, Invalid=1654, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:30:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 10:30:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 281. [2018-02-02 10:30:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:30:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 304 transitions. [2018-02-02 10:30:36,341 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 304 transitions. Word has length 67 [2018-02-02 10:30:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:36,341 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 304 transitions. [2018-02-02 10:30:36,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:30:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 304 transitions. [2018-02-02 10:30:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:30:36,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:36,342 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] [2018-02-02 10:30:36,342 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash 45834249, now seen corresponding path program 4 times [2018-02-02 10:30:36,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:36,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:36,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:30:36,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,868 INFO L182 omatonBuilderFactory]: Interpolants [19456#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 19457#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 19458#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 19459#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 19460#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 19461#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 19462#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 19463#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= main_~head~0.offset 0)), 19464#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (+ main_~head~0.offset 8)) 2) (= main_~head~0.offset 0)), 19465#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2)), 19466#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2))), 19467#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2)) (not (= 0 |main_#t~mem19|))), 19468#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 19469#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 19470#(and (= 0 |main_#t~mem20.offset|) (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 8)) 2)), 19471#(or (<= (+ main_~x~0.offset 1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)), 19472#(or (<= (+ main_~x~0.offset 1) 0) (= |main_#t~mem19| 2)), 19473#(<= (+ main_~x~0.offset 1) 0), 19448#true, 19449#false, 19450#(= 0 |main_#t~malloc0.offset|), 19451#(= main_~head~0.offset 0), 19452#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 19453#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 19454#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 19455#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0))] [2018-02-02 10:30:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:36,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:36,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:36,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:36,868 INFO L87 Difference]: Start difference. First operand 281 states and 304 transitions. Second operand 26 states. [2018-02-02 10:30:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:38,156 INFO L93 Difference]: Finished difference Result 295 states and 308 transitions. [2018-02-02 10:30:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:30:38,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-02-02 10:30:38,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:38,157 INFO L225 Difference]: With dead ends: 295 [2018-02-02 10:30:38,157 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 10:30:38,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=403, Invalid=2249, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:30:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 10:30:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 262. [2018-02-02 10:30:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-02 10:30:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 279 transitions. [2018-02-02 10:30:38,159 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 279 transitions. Word has length 69 [2018-02-02 10:30:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:38,159 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 279 transitions. [2018-02-02 10:30:38,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 279 transitions. [2018-02-02 10:30:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:30:38,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:38,160 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:38,160 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:38,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1831435194, now seen corresponding path program 2 times [2018-02-02 10:30:38,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:38,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:38,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:30:38,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,653 INFO L182 omatonBuilderFactory]: Interpolants [20096#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 20097#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.offset 0) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 20098#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem16.offset| 0) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= main_~head~0.offset 0)), 20099#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (+ main_~head~0.offset 8)) 2) (= main_~head~0.offset 0)), 20100#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2)), 20101#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2))), 20102#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (+ 0 8)) 2)) (not (= 0 |main_#t~mem19|))), 20103#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 20104#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (+ 0 8)) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20105#(and (= 0 |main_#t~mem20.offset|) (= (select (select |#memory_int| |main_#t~mem20.base|) (+ 0 8)) 2)), 20106#(or (<= (+ main_~x~0.offset 1) 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)), 20107#(or (<= (+ main_~x~0.offset 1) 0) (and (= |main_#t~mem18| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2))), 20108#(<= (+ main_~x~0.offset 1) 0), 20083#true, 20084#false, 20085#(= 0 |main_#t~malloc0.offset|), 20086#(= main_~head~0.offset 0), 20087#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 20088#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20089#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20090#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 20091#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 20092#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 20093#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 20094#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 20095#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0))] [2018-02-02 10:30:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:38,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:38,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:38,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:38,654 INFO L87 Difference]: Start difference. First operand 262 states and 279 transitions. Second operand 26 states. [2018-02-02 10:30:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:39,776 INFO L93 Difference]: Finished difference Result 285 states and 297 transitions. [2018-02-02 10:30:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:30:39,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-02-02 10:30:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:39,777 INFO L225 Difference]: With dead ends: 285 [2018-02-02 10:30:39,777 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 10:30:39,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=401, Invalid=2251, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:30:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 10:30:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2018-02-02 10:30:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 10:30:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 259 transitions. [2018-02-02 10:30:39,780 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 259 transitions. Word has length 69 [2018-02-02 10:30:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:39,780 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 259 transitions. [2018-02-02 10:30:39,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 259 transitions. [2018-02-02 10:30:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:30:39,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:39,781 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:39,781 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1457041330, now seen corresponding path program 1 times [2018-02-02 10:30:39,781 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:39,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:40,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:30:40,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,259 INFO L182 omatonBuilderFactory]: Interpolants [20691#true, 20692#false, 20693#(not (= 0 |main_#t~malloc0.base|)), 20694#(not (= 0 main_~head~0.base)), 20695#(and (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base))), 20696#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20697#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20698#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20699#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~head~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 20700#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 20701#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20702#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 20703#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 20704#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 20705#(and (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 20706#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 20707#(and (not (= |main_#t~mem16.base| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 20708#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 20709#(and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base)), 20710#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base))), 20711#(or (not (= 0 |main_#t~mem19|)) (and (= main_~x~0.offset main_~head~0.offset) (not (= 0 main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base))), 20712#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem20.base|) (not (= main_~head~0.base |main_#t~mem20.base|)) (not (= 0 main_~head~0.base))), 20713#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 20714#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base main_~x~0.base)) (not (= 0 main_~head~0.base))), 20715#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 main_~head~0.base))), 20716#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base))), 20717#(and (= 1 (select (store |#valid| main_~head~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~head~0.base))), 20718#(and (= 1 (select (store |#valid| main_~head~0.base 0) |main_#t~mem25.base|)) (not (= 0 main_~head~0.base))), 20719#(and (= 1 (select (store |#valid| main_~head~0.base 0) main_~x~0.base)) (not (= 0 main_~head~0.base))), 20720#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:40,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:30:40,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:30:40,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:30:40,259 INFO L87 Difference]: Start difference. First operand 245 states and 259 transitions. Second operand 30 states. [2018-02-02 10:30:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:41,426 INFO L93 Difference]: Finished difference Result 291 states and 303 transitions. [2018-02-02 10:30:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:30:41,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 71 [2018-02-02 10:30:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:41,427 INFO L225 Difference]: With dead ends: 291 [2018-02-02 10:30:41,427 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 10:30:41,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=764, Invalid=2896, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:30:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 10:30:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 250. [2018-02-02 10:30:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:30:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 265 transitions. [2018-02-02 10:30:41,429 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 265 transitions. Word has length 71 [2018-02-02 10:30:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:41,429 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 265 transitions. [2018-02-02 10:30:41,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:30:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 265 transitions. [2018-02-02 10:30:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:30:41,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:41,430 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:41,430 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1457041329, now seen corresponding path program 1 times [2018-02-02 10:30:41,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:41,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:41,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:41,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:30:41,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:41,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 10:30:41,785 INFO L182 omatonBuilderFactory]: Interpolants [21324#true, 21325#false, 21326#(= 1 (select |#valid| main_~head~0.base)), 21327#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21328#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21329#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 21330#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 21331#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21332#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21333#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 21334#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))), 21335#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21336#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 21337#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21338#(and (not (= |main_#t~mem16.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21339#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 21340#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 21341#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))), 21342#(or (not (= 0 |main_#t~mem19|)) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))), 21343#(and (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21344#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21345#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21346#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21347#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 21348#(and (<= 12 (select |#length| |main_#t~mem25.base|)) (= 0 |main_#t~mem25.offset|)), 21349#(and (<= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-02-02 10:30:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:41,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:30:41,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:30:41,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:30:41,786 INFO L87 Difference]: Start difference. First operand 250 states and 265 transitions. Second operand 26 states. [2018-02-02 10:30:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:42,627 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2018-02-02 10:30:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:30:42,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-02-02 10:30:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:42,628 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:30:42,628 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:30:42,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1924, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:30:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:30:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 252. [2018-02-02 10:30:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 10:30:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 267 transitions. [2018-02-02 10:30:42,630 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 267 transitions. Word has length 71 [2018-02-02 10:30:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:42,630 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 267 transitions. [2018-02-02 10:30:42,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:30:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2018-02-02 10:30:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:42,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:42,631 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:42,631 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1080396419, now seen corresponding path program 5 times [2018-02-02 10:30:42,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:42,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:43,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:43,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:30:43,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:43,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 10:30:43,116 INFO L182 omatonBuilderFactory]: Interpolants [21915#true, 21916#false, 21917#(= 1 (select |#valid| main_~head~0.base)), 21918#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21919#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21920#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 21921#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 21922#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 21923#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 21924#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 21925#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base))), 21926#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 21927#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 21928#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 21929#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 21930#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 21931#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))), 21932#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 21933#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 21934#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 21935#(and (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 21936#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 21937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 21938#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))))), 21939#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem19|))), 21940#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 21941#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 21942#(= 1 (select |#valid| |main_#t~mem20.base|)), 21943#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:43,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:30:43,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:30:43,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:30:43,117 INFO L87 Difference]: Start difference. First operand 252 states and 267 transitions. Second operand 29 states. [2018-02-02 10:30:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:44,587 INFO L93 Difference]: Finished difference Result 332 states and 351 transitions. [2018-02-02 10:30:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:30:44,587 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-02-02 10:30:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:44,588 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:30:44,588 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:30:44,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=2979, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:30:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:30:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 261. [2018-02-02 10:30:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:30:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 278 transitions. [2018-02-02 10:30:44,590 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 278 transitions. Word has length 74 [2018-02-02 10:30:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:44,590 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 278 transitions. [2018-02-02 10:30:44,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:30:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 278 transitions. [2018-02-02 10:30:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:44,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:44,591 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:44,591 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1080396418, now seen corresponding path program 4 times [2018-02-02 10:30:44,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:44,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:45,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:45,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:30:45,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:45,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 10:30:45,250 INFO L182 omatonBuilderFactory]: Interpolants [22597#true, 22598#false, 22599#(= 1 (select |#valid| main_~head~0.base)), 22600#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 22601#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 22602#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 22603#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22604#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 22605#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 22606#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 22607#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 12 (select |#length| |main_#t~malloc5.base|))), 22608#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22609#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 22610#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| |main_#t~mem9.base|)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 22611#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22612#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 22613#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))), 22614#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22615#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 22616#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 22617#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 22618#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 22619#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 22620#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 22621#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not (= 0 |main_#t~mem19|))), 22622#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 22623#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 22624#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 22625#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:45,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:30:45,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:30:45,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:30:45,250 INFO L87 Difference]: Start difference. First operand 261 states and 278 transitions. Second operand 29 states. [2018-02-02 10:30:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:46,890 INFO L93 Difference]: Finished difference Result 371 states and 390 transitions. [2018-02-02 10:30:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:30:46,890 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-02-02 10:30:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:46,891 INFO L225 Difference]: With dead ends: 371 [2018-02-02 10:30:46,891 INFO L226 Difference]: Without dead ends: 371 [2018-02-02 10:30:46,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=299, Invalid=2353, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:30:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-02 10:30:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 261. [2018-02-02 10:30:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:30:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 277 transitions. [2018-02-02 10:30:46,893 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 277 transitions. Word has length 74 [2018-02-02 10:30:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:46,893 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 277 transitions. [2018-02-02 10:30:46,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:30:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 277 transitions. [2018-02-02 10:30:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:46,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:46,893 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:46,893 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1337301434, now seen corresponding path program 3 times [2018-02-02 10:30:46,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:46,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:47,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:30:47,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,396 INFO L182 omatonBuilderFactory]: Interpolants [23304#true, 23305#false, 23306#(= 1 (select |#valid| main_~head~0.base)), 23307#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23308#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23309#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23310#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 23311#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 23312#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 23313#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 23314#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base))), 23315#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 23316#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 23317#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 23318#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 23319#(and (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 23320#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))), 23321#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23322#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 23323#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23324#(and (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 23325#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 23326#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 23327#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))))), 23328#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= 0 |main_#t~mem19|))), 23329#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 23330#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23331#(= 1 (select |#valid| |main_#t~mem22.base|)), 23332#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:47,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:30:47,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:30:47,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:30:47,397 INFO L87 Difference]: Start difference. First operand 261 states and 277 transitions. Second operand 29 states. [2018-02-02 10:30:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:48,861 INFO L93 Difference]: Finished difference Result 345 states and 365 transitions. [2018-02-02 10:30:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:30:48,862 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-02-02 10:30:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:48,862 INFO L225 Difference]: With dead ends: 345 [2018-02-02 10:30:48,862 INFO L226 Difference]: Without dead ends: 345 [2018-02-02 10:30:48,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=443, Invalid=2979, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:30:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-02 10:30:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 269. [2018-02-02 10:30:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:30:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 286 transitions. [2018-02-02 10:30:48,865 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 286 transitions. Word has length 74 [2018-02-02 10:30:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:48,866 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 286 transitions. [2018-02-02 10:30:48,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:30:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 286 transitions. [2018-02-02 10:30:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:48,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:48,866 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:48,866 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr54EnsuresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1337301435, now seen corresponding path program 2 times [2018-02-02 10:30:48,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:48,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:49,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:30:49,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,559 INFO L182 omatonBuilderFactory]: Interpolants [24007#true, 24008#false, 24009#(= 1 (select |#valid| main_~head~0.base)), 24010#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24011#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24012#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24013#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 24014#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 24015#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 24016#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 24017#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 12 (select |#length| |main_#t~malloc5.base|))), 24018#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24019#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 24020#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| |main_#t~mem9.base|)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 24021#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24022#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 24023#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc12.base|)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc12.base|)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc12.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc12.offset|)) main_~head~0.base) main_~head~0.offset)))), 24024#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24025#(and (= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem14.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem14.base| (store (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem14.base|))), 24026#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 24027#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem16.base| main_~head~0.base))), 24028#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 24029#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 24030#(or (not (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 24031#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not (= 0 |main_#t~mem19|))), 24032#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 24033#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24034#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 24035#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:30:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:49,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:30:49,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:30:49,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:30:49,559 INFO L87 Difference]: Start difference. First operand 269 states and 286 transitions. Second operand 29 states. Received shutdown request... [2018-02-02 10:30:51,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:30:51,123 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:30:51,128 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:30:51,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:30:51 BoogieIcfgContainer [2018-02-02 10:30:51,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:30:51,128 INFO L168 Benchmark]: Toolchain (without parser) took 50742.08 ms. Allocated memory was 403.7 MB in the beginning and 1.1 GB in the end (delta: 651.2 MB). Free memory was 360.4 MB in the beginning and 903.9 MB in the end (delta: -543.5 MB). Peak memory consumption was 107.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:51,129 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:30:51,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.58 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:51,129 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 403.7 MB. Free memory is still 347.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:30:51,130 INFO L168 Benchmark]: RCFGBuilder took 420.81 ms. Allocated memory is still 403.7 MB. Free memory was 344.5 MB in the beginning and 311.4 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:51,130 INFO L168 Benchmark]: TraceAbstraction took 50115.83 ms. Allocated memory was 403.7 MB in the beginning and 1.1 GB in the end (delta: 651.2 MB). Free memory was 308.8 MB in the beginning and 903.9 MB in the end (delta: -595.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:51,130 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.16 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.58 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 347.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 403.7 MB. Free memory is still 347.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 420.81 ms. Allocated memory is still 403.7 MB. Free memory was 344.5 MB in the beginning and 311.4 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50115.83 ms. Allocated memory was 403.7 MB in the beginning and 1.1 GB in the end (delta: 651.2 MB). Free memory was 308.8 MB in the beginning and 903.9 MB in the end (delta: -595.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1038). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (269states) and interpolant automaton (currently 31 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (276 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 55 error locations. TIMEOUT Result, 50.0s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 34.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3299 SDtfs, 20315 SDslu, 28537 SDs, 0 SdLazy, 38053 SolverSat, 3556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1696 GetRequests, 141 SyntacticMatches, 35 SemanticMatches, 1520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13740 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 23/373 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 2453 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2325 NumberOfCodeBlocks, 2325 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2408286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 19 PerfectInterpolantSequences, 23/373 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/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-30-51-138.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-token_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-30-51-138.csv Completed graceful shutdown