java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:33:19,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:33:19,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:33:19,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:33:19,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:33:19,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:33:19,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:33:19,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:33:19,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:33:19,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:33:19,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:33:19,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:33:19,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:33:19,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:33:19,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:33:19,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:33:19,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:33:19,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:33:19,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:33:19,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:33:19,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:33:19,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:33:19,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:33:19,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:33:19,157 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:33:19,157 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:33:19,158 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:33:19,158 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:33:19,158 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:33:19,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:33:19,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:33:19,159 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:33:19,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:33:19,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:33:19,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:33:19,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:33:19,171 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:33:19,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:33:19,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:33:19,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:33:19,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:33:19,171 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:33:19,172 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:33:19,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:33:19,173 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:33:19,173 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:33:19,173 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:33:19,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:33:19,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:33:19,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:33:19,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:33:19,214 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:33:19,219 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:33:19,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:33:19,221 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:33:19,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:33:19,368 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:33:19,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:33:19,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:33:19,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:33:19,376 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:33:19,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637150ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19, skipping insertion in model container [2018-02-02 10:33:19,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:33:19,426 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:33:19,518 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:33:19,538 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:33:19,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19 WrapperNode [2018-02-02 10:33:19,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:33:19,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:33:19,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:33:19,547 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:33:19,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (1/1) ... [2018-02-02 10:33:19,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:33:19,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:33:19,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:33:19,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:33:19,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (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:33:19,613 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:33:19,614 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:33:19,614 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:33:19,614 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:33:19,615 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:33:19,615 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:33:19,615 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:33:19,615 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:33:19,615 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:33:19,995 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:33:19,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:33:19 BoogieIcfgContainer [2018-02-02 10:33:19,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:33:19,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:33:19,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:33:20,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:33:20,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:33:19" (1/3) ... [2018-02-02 10:33:20,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4821dc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:33:20, skipping insertion in model container [2018-02-02 10:33:20,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:33:19" (2/3) ... [2018-02-02 10:33:20,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4821dc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:33:20, skipping insertion in model container [2018-02-02 10:33:20,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:33:19" (3/3) ... [2018-02-02 10:33:20,003 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:33:20,008 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:33:20,014 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-02 10:33:20,037 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:33:20,037 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:33:20,038 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:33:20,038 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:33:20,038 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:33:20,038 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:33:20,038 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:33:20,038 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:33:20,039 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:33:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-02-02 10:33:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:33:20,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,058 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,058 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208534, now seen corresponding path program 1 times [2018-02-02 10:33:20,097 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:20,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:20,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,170 INFO L182 omatonBuilderFactory]: Interpolants [172#true, 173#false, 174#(= 1 (select |#valid| |main_#t~malloc0.base|)), 175#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:33:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:33:20,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:33:20,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:33:20,232 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-02-02 10:33:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:20,370 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2018-02-02 10:33:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:33:20,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:33:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:20,379 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:33:20,379 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:33:20,381 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:33:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:33:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2018-02-02 10:33:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:33:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-02-02 10:33:20,427 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 8 [2018-02-02 10:33:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:20,428 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-02-02 10:33:20,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:33:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-02-02 10:33:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:33:20,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,429 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,429 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1406208535, now seen corresponding path program 1 times [2018-02-02 10:33:20,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:20,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:20,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,490 INFO L182 omatonBuilderFactory]: Interpolants [522#true, 523#false, 524#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 525#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-02 10:33:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:33:20,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:33:20,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:33:20,492 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 4 states. [2018-02-02 10:33:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:20,577 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2018-02-02 10:33:20,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:33:20,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:33:20,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:20,578 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:33:20,578 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:33:20,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:33:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:33:20,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-02-02 10:33:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:33:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-02-02 10:33:20,586 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 8 [2018-02-02 10:33:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:20,586 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-02-02 10:33:20,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:33:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-02-02 10:33:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:33:20,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,587 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588635, now seen corresponding path program 1 times [2018-02-02 10:33:20,588 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:20,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:20,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:20,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,663 INFO L182 omatonBuilderFactory]: Interpolants [857#true, 858#false, 859#(= (select |#valid| main_~head~0.base) 1), 860#(= (select |#valid| main_~x~0.base) 1)] [2018-02-02 10:33:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:33:20,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:33:20,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:33:20,664 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 4 states. [2018-02-02 10:33:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:20,774 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 10:33:20,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:33:20,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:33:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:20,776 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:33:20,776 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:33:20,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:33:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:33:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2018-02-02 10:33:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:33:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2018-02-02 10:33:20,783 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 15 [2018-02-02 10:33:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:20,783 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2018-02-02 10:33:20,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:33:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2018-02-02 10:33:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:33:20,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:20,784 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:20,784 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1461588636, now seen corresponding path program 1 times [2018-02-02 10:33:20,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:20,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:20,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:33:20,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,849 INFO L182 omatonBuilderFactory]: Interpolants [1200#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 1201#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 1195#true, 1196#false, 1197#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 1198#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 1199#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-02 10:33:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:20,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:33:20,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:33:20,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:33:20,855 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 7 states. [2018-02-02 10:33:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:21,185 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-02-02 10:33:21,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:33:21,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:33:21,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:21,187 INFO L225 Difference]: With dead ends: 243 [2018-02-02 10:33:21,187 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 10:33:21,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 10:33:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2018-02-02 10:33:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 10:33:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-02-02 10:33:21,193 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 15 [2018-02-02 10:33:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:21,193 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-02-02 10:33:21,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:33:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-02-02 10:33:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:33:21,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:21,197 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:33:21,197 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash -191427424, now seen corresponding path program 1 times [2018-02-02 10:33:21,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:21,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:21,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:21,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:21,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:33:21,246 INFO L182 omatonBuilderFactory]: Interpolants [1670#true, 1671#false, 1672#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1673#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1674#(= 1 (select |#valid| |main_#t~mem6.base|)), 1675#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:21,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:33:21,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:21,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:21,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:21,246 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 6 states. [2018-02-02 10:33:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:21,512 INFO L93 Difference]: Finished difference Result 409 states and 470 transitions. [2018-02-02 10:33:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:33:21,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:33:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:21,515 INFO L225 Difference]: With dead ends: 409 [2018-02-02 10:33:21,515 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 10:33:21,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:33:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 10:33:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 218. [2018-02-02 10:33:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:33:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-02-02 10:33:21,525 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 18 [2018-02-02 10:33:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:21,525 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-02-02 10:33:21,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-02-02 10:33:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:33:21,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:21,526 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:33:21,526 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -191427423, now seen corresponding path program 1 times [2018-02-02 10:33:21,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:21,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:21,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:21,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,603 INFO L182 omatonBuilderFactory]: Interpolants [2310#true, 2311#false, 2312#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2313#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2314#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 2315#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:33:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:21,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:21,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:21,604 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 6 states. [2018-02-02 10:33:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:21,941 INFO L93 Difference]: Finished difference Result 398 states and 460 transitions. [2018-02-02 10:33:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:33:21,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:33:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:21,943 INFO L225 Difference]: With dead ends: 398 [2018-02-02 10:33:21,943 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 10:33:21,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:33:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 10:33:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 207. [2018-02-02 10:33:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 10:33:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2018-02-02 10:33:21,954 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 18 [2018-02-02 10:33:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:21,955 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2018-02-02 10:33:21,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2018-02-02 10:33:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:33:21,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:21,956 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] [2018-02-02 10:33:21,956 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2092077490, now seen corresponding path program 1 times [2018-02-02 10:33:21,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:21,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:21,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:21,989 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,990 INFO L182 omatonBuilderFactory]: Interpolants [2932#true, 2933#false, 2934#(= main_~marked~0 0)] [2018-02-02 10:33:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:21,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:33:21,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:33:21,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:21,991 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 3 states. [2018-02-02 10:33:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:22,003 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2018-02-02 10:33:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:33:22,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-02 10:33:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:22,005 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:33:22,005 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:33:22,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:33:22,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2018-02-02 10:33:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 10:33:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 251 transitions. [2018-02-02 10:33:22,010 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 251 transitions. Word has length 24 [2018-02-02 10:33:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:22,010 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 251 transitions. [2018-02-02 10:33:22,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:33:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 251 transitions. [2018-02-02 10:33:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:33:22,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:22,014 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:22,014 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -252118467, now seen corresponding path program 1 times [2018-02-02 10:33:22,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:22,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:22,217 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:33:22,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:22,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:33:22,218 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:22,219 INFO L182 omatonBuilderFactory]: Interpolants [3395#true, 3396#false, 3397#(= 1 (select |#valid| main_~head~0.base)), 3398#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3399#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 3400#(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)), 3401#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 3402#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 3403#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 3404#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 3405#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3406#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3407#(= 1 (select |#valid| |main_#t~mem12.base|))] [2018-02-02 10:33:22,219 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:33:22,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:33:22,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:33:22,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:33:22,220 INFO L87 Difference]: Start difference. First operand 218 states and 251 transitions. Second operand 13 states. [2018-02-02 10:33:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:23,001 INFO L93 Difference]: Finished difference Result 456 states and 514 transitions. [2018-02-02 10:33:23,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:33:23,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-02 10:33:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:23,003 INFO L225 Difference]: With dead ends: 456 [2018-02-02 10:33:23,003 INFO L226 Difference]: Without dead ends: 456 [2018-02-02 10:33:23,003 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-02-02 10:33:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 244. [2018-02-02 10:33:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:33:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 282 transitions. [2018-02-02 10:33:23,007 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 282 transitions. Word has length 36 [2018-02-02 10:33:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:23,008 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 282 transitions. [2018-02-02 10:33:23,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:33:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 282 transitions. [2018-02-02 10:33:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:33:23,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:23,009 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:23,009 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -252118466, now seen corresponding path program 1 times [2018-02-02 10:33:23,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:23,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:23,184 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:33:23,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:23,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:33:23,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:23,185 INFO L182 omatonBuilderFactory]: Interpolants [4144#true, 4145#false, 4146#(= 1 (select |#valid| main_~head~0.base)), 4147#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4148#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4149#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 4150#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4151#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 4152#(or (and (= 8 (select |#length| (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))) (= 0 main_~marked~0)), 4153#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4154#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4155#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 10:33:23,185 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:33:23,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:33:23,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:33:23,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:33:23,186 INFO L87 Difference]: Start difference. First operand 244 states and 282 transitions. Second operand 12 states. [2018-02-02 10:33:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:23,851 INFO L93 Difference]: Finished difference Result 455 states and 508 transitions. [2018-02-02 10:33:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:33:23,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-02 10:33:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:23,859 INFO L225 Difference]: With dead ends: 455 [2018-02-02 10:33:23,859 INFO L226 Difference]: Without dead ends: 455 [2018-02-02 10:33:23,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-02-02 10:33:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 244. [2018-02-02 10:33:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 10:33:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 281 transitions. [2018-02-02 10:33:23,863 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 281 transitions. Word has length 36 [2018-02-02 10:33:23,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:23,863 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 281 transitions. [2018-02-02 10:33:23,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:33:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 281 transitions. [2018-02-02 10:33:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:33:23,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:23,864 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] [2018-02-02 10:33:23,864 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1873975739, now seen corresponding path program 1 times [2018-02-02 10:33:23,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:23,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:33:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:23,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:23,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:33:23,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:23,927 INFO L182 omatonBuilderFactory]: Interpolants [4880#(or |main_#t~short14| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4881#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4882#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 4883#(not |main_#t~short19|), 4877#true, 4878#false, 4879#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem11.base|) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:23,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:33:23,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:33:23,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:33:23,927 INFO L87 Difference]: Start difference. First operand 244 states and 281 transitions. Second operand 7 states. [2018-02-02 10:33:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:24,078 INFO L93 Difference]: Finished difference Result 280 states and 321 transitions. [2018-02-02 10:33:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:33:24,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 10:33:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:24,080 INFO L225 Difference]: With dead ends: 280 [2018-02-02 10:33:24,080 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 10:33:24,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:33:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 10:33:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-02-02 10:33:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 10:33:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2018-02-02 10:33:24,084 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 43 [2018-02-02 10:33:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:24,084 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2018-02-02 10:33:24,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:33:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2018-02-02 10:33:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:33:24,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:24,086 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] [2018-02-02 10:33:24,086 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1872128697, now seen corresponding path program 1 times [2018-02-02 10:33:24,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:24,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:24,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:24,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:24,136 INFO L182 omatonBuilderFactory]: Interpolants [5428#true, 5429#false, 5430#(= 1 (select |#valid| |main_#t~malloc22.base|)), 5431#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-02 10:33:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:33:24,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:33:24,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:33:24,137 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand 4 states. [2018-02-02 10:33:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:24,187 INFO L93 Difference]: Finished difference Result 256 states and 292 transitions. [2018-02-02 10:33:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:33:24,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 10:33:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:24,189 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:33:24,189 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:33:24,189 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:33:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:33:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2018-02-02 10:33:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 10:33:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 290 transitions. [2018-02-02 10:33:24,193 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 290 transitions. Word has length 43 [2018-02-02 10:33:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:24,194 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 290 transitions. [2018-02-02 10:33:24,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:33:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 290 transitions. [2018-02-02 10:33:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:33:24,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:24,195 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] [2018-02-02 10:33:24,195 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1872128696, now seen corresponding path program 1 times [2018-02-02 10:33:24,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:24,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:24,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:24,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:24,241 INFO L182 omatonBuilderFactory]: Interpolants [5943#true, 5944#false, 5945#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= 0 |main_#t~malloc22.offset|)), 5946#(and (= (select |#length| main_~tmp~0.base) 8) (= main_~tmp~0.offset 0))] [2018-02-02 10:33:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:33:24,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:33:24,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:33:24,241 INFO L87 Difference]: Start difference. First operand 253 states and 290 transitions. Second operand 4 states. [2018-02-02 10:33:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:24,327 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2018-02-02 10:33:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:33:24,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-02 10:33:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:24,329 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:33:24,329 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:33:24,329 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:33:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:33:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-02-02 10:33:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:33:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 284 transitions. [2018-02-02 10:33:24,333 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 284 transitions. Word has length 43 [2018-02-02 10:33:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:24,334 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 284 transitions. [2018-02-02 10:33:24,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:33:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2018-02-02 10:33:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:33:24,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:24,335 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] [2018-02-02 10:33:24,335 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -794533459, now seen corresponding path program 1 times [2018-02-02 10:33:24,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:24,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:24,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:24,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:24,362 INFO L182 omatonBuilderFactory]: Interpolants [6449#true, 6450#false, 6451#(not |main_#t~short14|)] [2018-02-02 10:33:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:24,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:33:24,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:33:24,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:24,363 INFO L87 Difference]: Start difference. First operand 250 states and 284 transitions. Second operand 3 states. [2018-02-02 10:33:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:24,369 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2018-02-02 10:33:24,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:33:24,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-02-02 10:33:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:24,370 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:33:24,370 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:33:24,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:33:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-02-02 10:33:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:33:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 282 transitions. [2018-02-02 10:33:24,374 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 282 transitions. Word has length 43 [2018-02-02 10:33:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:24,375 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 282 transitions. [2018-02-02 10:33:24,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:33:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 282 transitions. [2018-02-02 10:33:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:33:24,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:24,376 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] [2018-02-02 10:33:24,376 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1865614704, now seen corresponding path program 1 times [2018-02-02 10:33:24,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:24,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:24,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:24,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:33:24,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:24,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:33:24,587 INFO L182 omatonBuilderFactory]: Interpolants [6952#true, 6953#false, 6954#(= 1 (select |#valid| main_~head~0.base)), 6955#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 6956#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 6957#(and (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)), 6958#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6959#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 6960#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 6961#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 6962#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 6963#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6964#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6965#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 6966#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:33:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:24,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:33:24,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:33:24,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:33:24,588 INFO L87 Difference]: Start difference. First operand 250 states and 282 transitions. Second operand 15 states. [2018-02-02 10:33:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:25,513 INFO L93 Difference]: Finished difference Result 488 states and 547 transitions. [2018-02-02 10:33:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:33:25,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 10:33:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:25,514 INFO L225 Difference]: With dead ends: 488 [2018-02-02 10:33:25,515 INFO L226 Difference]: Without dead ends: 488 [2018-02-02 10:33:25,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:33:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-02-02 10:33:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 274. [2018-02-02 10:33:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 10:33:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 314 transitions. [2018-02-02 10:33:25,518 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 314 transitions. Word has length 46 [2018-02-02 10:33:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:25,518 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 314 transitions. [2018-02-02 10:33:25,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:33:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 314 transitions. [2018-02-02 10:33:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:33:25,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:25,519 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] [2018-02-02 10:33:25,519 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1865614705, now seen corresponding path program 1 times [2018-02-02 10:33:25,520 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:25,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:25,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:25,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:25,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:25,557 INFO L182 omatonBuilderFactory]: Interpolants [7776#(= 1 (select |#valid| main_~x~0.base)), 7771#true, 7772#false, 7773#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 7774#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7775#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:33:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:25,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:25,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:25,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:25,557 INFO L87 Difference]: Start difference. First operand 274 states and 314 transitions. Second operand 6 states. [2018-02-02 10:33:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:25,799 INFO L93 Difference]: Finished difference Result 298 states and 339 transitions. [2018-02-02 10:33:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:33:25,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-02-02 10:33:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:25,800 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:33:25,801 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:33:25,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:33:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 273. [2018-02-02 10:33:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:33:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 312 transitions. [2018-02-02 10:33:25,805 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 312 transitions. Word has length 46 [2018-02-02 10:33:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:25,806 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 312 transitions. [2018-02-02 10:33:25,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 312 transitions. [2018-02-02 10:33:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:33:25,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:25,806 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] [2018-02-02 10:33:25,807 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1101465968, now seen corresponding path program 1 times [2018-02-02 10:33:25,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:25,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:25,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:25,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:25,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:25,848 INFO L182 omatonBuilderFactory]: Interpolants [8356#true, 8357#false, 8358#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 8359#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8360#(= 1 (select |#valid| |main_#t~mem20.base|)), 8361#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:25,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:25,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:25,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:25,849 INFO L87 Difference]: Start difference. First operand 273 states and 312 transitions. Second operand 6 states. [2018-02-02 10:33:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:25,998 INFO L93 Difference]: Finished difference Result 301 states and 342 transitions. [2018-02-02 10:33:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:33:25,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-02-02 10:33:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:25,999 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:33:25,999 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:33:25,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:33:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 282. [2018-02-02 10:33:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 10:33:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 326 transitions. [2018-02-02 10:33:26,002 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 326 transitions. Word has length 47 [2018-02-02 10:33:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:26,002 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 326 transitions. [2018-02-02 10:33:26,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 326 transitions. [2018-02-02 10:33:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:33:26,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:26,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, 1] [2018-02-02 10:33:26,003 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1101465967, now seen corresponding path program 1 times [2018-02-02 10:33:26,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:26,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:26,203 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:33:26,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:26,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:33:26,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:26,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:33:26,204 INFO L182 omatonBuilderFactory]: Interpolants [8960#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8961#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 8962#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 8963#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 8964#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8965#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8966#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|))), 8967#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 8953#true, 8954#false, 8955#(= 1 (select |#valid| main_~head~0.base)), 8956#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 8957#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 8958#(and (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)), 8959#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:33:26,204 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:33:26,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:33:26,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:33:26,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:33:26,205 INFO L87 Difference]: Start difference. First operand 282 states and 326 transitions. Second operand 15 states. [2018-02-02 10:33:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:26,912 INFO L93 Difference]: Finished difference Result 505 states and 577 transitions. [2018-02-02 10:33:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:33:26,913 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-02 10:33:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:26,914 INFO L225 Difference]: With dead ends: 505 [2018-02-02 10:33:26,914 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 10:33:26,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:33:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 10:33:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 299. [2018-02-02 10:33:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:33:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. [2018-02-02 10:33:26,920 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 347 transitions. Word has length 47 [2018-02-02 10:33:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:26,920 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 347 transitions. [2018-02-02 10:33:26,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:33:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 347 transitions. [2018-02-02 10:33:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:33:26,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:26,921 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:26,921 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -402134456, now seen corresponding path program 2 times [2018-02-02 10:33:26,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:26,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:27,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:27,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:33:27,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:27,165 INFO L182 omatonBuilderFactory]: Interpolants [9824#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 9825#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| main_~head~0.base))), 9826#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 9827#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9828#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9829#(= 1 (select |#valid| |main_#t~mem12.base|)), 9812#true, 9813#false, 9814#(= 1 (select |#valid| main_~head~0.base)), 9815#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 9816#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 9817#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9818#(and (= |main_#t~mem6.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~mem6.base|))), 9819#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 9820#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 9821#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 9822#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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))), 9823#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)))] [2018-02-02 10:33:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:27,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:33:27,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:33:27,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:33:27,166 INFO L87 Difference]: Start difference. First operand 299 states and 347 transitions. Second operand 18 states. [2018-02-02 10:33:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:28,207 INFO L93 Difference]: Finished difference Result 632 states and 723 transitions. [2018-02-02 10:33:28,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:33:28,207 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:33:28,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:28,209 INFO L225 Difference]: With dead ends: 632 [2018-02-02 10:33:28,209 INFO L226 Difference]: Without dead ends: 632 [2018-02-02 10:33:28,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:33:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-02-02 10:33:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 334. [2018-02-02 10:33:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:33:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 387 transitions. [2018-02-02 10:33:28,217 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 387 transitions. Word has length 48 [2018-02-02 10:33:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:28,217 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 387 transitions. [2018-02-02 10:33:28,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:33:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 387 transitions. [2018-02-02 10:33:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:33:28,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:28,218 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:28,218 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash -402134455, now seen corresponding path program 2 times [2018-02-02 10:33:28,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:28,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:28,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:28,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:33:28,526 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:28,526 INFO L182 omatonBuilderFactory]: Interpolants [10852#true, 10853#false, 10854#(= 1 (select |#valid| main_~head~0.base)), 10855#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 10856#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 10857#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10858#(and (= |main_#t~mem6.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~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10859#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10860#(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)) (= 8 (select |#length| main_~x~0.base)) (= 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))), 10861#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (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)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 10862#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (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)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 10863#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~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))), 10864#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 10865#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10866#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10867#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 10868#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10869#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10870#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 10:33:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:28,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:33:28,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:33:28,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:33:28,527 INFO L87 Difference]: Start difference. First operand 334 states and 387 transitions. Second operand 19 states. [2018-02-02 10:33:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:29,650 INFO L93 Difference]: Finished difference Result 584 states and 671 transitions. [2018-02-02 10:33:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:33:29,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 10:33:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:29,651 INFO L225 Difference]: With dead ends: 584 [2018-02-02 10:33:29,651 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 10:33:29,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=1216, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:33:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 10:33:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 334. [2018-02-02 10:33:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 10:33:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 386 transitions. [2018-02-02 10:33:29,656 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 386 transitions. Word has length 48 [2018-02-02 10:33:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:29,657 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 386 transitions. [2018-02-02 10:33:29,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:33:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 386 transitions. [2018-02-02 10:33:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:33:29,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:29,657 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:29,658 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 364321685, now seen corresponding path program 1 times [2018-02-02 10:33:29,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:29,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:29,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:29,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:33:29,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:29,894 INFO L182 omatonBuilderFactory]: Interpolants [11840#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~marked~0)), 11841#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 11842#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 11843#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 11844#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11845#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 11846#(not |main_#t~short14|), 11831#true, 11832#false, 11833#(= 1 (select |#valid| main_~head~0.base)), 11834#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 11835#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 11836#(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)), 11837#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 11838#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 11839#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:29,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:33:29,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:33:29,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:33:29,895 INFO L87 Difference]: Start difference. First operand 334 states and 386 transitions. Second operand 16 states. [2018-02-02 10:33:30,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:30,772 INFO L93 Difference]: Finished difference Result 462 states and 523 transitions. [2018-02-02 10:33:30,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:33:30,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-02-02 10:33:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:30,773 INFO L225 Difference]: With dead ends: 462 [2018-02-02 10:33:30,773 INFO L226 Difference]: Without dead ends: 462 [2018-02-02 10:33:30,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:33:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-02-02 10:33:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 325. [2018-02-02 10:33:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 10:33:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 371 transitions. [2018-02-02 10:33:30,777 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 371 transitions. Word has length 50 [2018-02-02 10:33:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:30,777 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 371 transitions. [2018-02-02 10:33:30,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:33:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 371 transitions. [2018-02-02 10:33:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:33:30,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:30,778 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:33:30,778 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1338693313, now seen corresponding path program 1 times [2018-02-02 10:33:30,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:30,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:31,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:31,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:33:31,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:31,014 INFO L182 omatonBuilderFactory]: Interpolants [12678#true, 12679#false, 12680#(= 1 (select |#valid| main_~head~0.base)), 12681#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 12682#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 12683#(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)), 12684#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 12685#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 12686#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12687#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~marked~0)), 12688#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12689#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 12690#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 12691#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12692#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 12693#(not |main_#t~short19|)] [2018-02-02 10:33:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:31,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:33:31,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:33:31,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:33:31,015 INFO L87 Difference]: Start difference. First operand 325 states and 371 transitions. Second operand 16 states. [2018-02-02 10:33:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:32,012 INFO L93 Difference]: Finished difference Result 440 states and 497 transitions. [2018-02-02 10:33:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:33:32,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 10:33:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:32,013 INFO L225 Difference]: With dead ends: 440 [2018-02-02 10:33:32,013 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 10:33:32,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=1168, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:33:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 10:33:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 319. [2018-02-02 10:33:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-02-02 10:33:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 363 transitions. [2018-02-02 10:33:32,017 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 363 transitions. Word has length 58 [2018-02-02 10:33:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:32,018 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 363 transitions. [2018-02-02 10:33:32,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:33:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 363 transitions. [2018-02-02 10:33:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:33:32,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:32,019 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:32,019 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1539545307, now seen corresponding path program 2 times [2018-02-02 10:33:32,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:32,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:32,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:32,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:33:32,268 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:32,268 INFO L182 omatonBuilderFactory]: Interpolants [13504#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 13505#(or (and (= main_~marked~0 (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))) (= 0 main_~marked~0)), 13506#(and (not (= 0 main_~marked~0)) (= main_~marked~0 (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))), 13507#(and (not (= 0 (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))), 13508#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 13509#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13510#(and (not (= |main_#t~mem6.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13511#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 13512#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 13513#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 13514#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13515#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13516#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 13517#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 13497#true, 13498#false, 13499#(= 1 (select |#valid| main_~head~0.base)), 13500#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 13501#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 13502#(and (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) (= (select |#valid| main_~x~0.base) 1)), 13503#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:33:32,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:32,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:33:32,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:33:32,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:33:32,269 INFO L87 Difference]: Start difference. First operand 319 states and 363 transitions. Second operand 21 states. [2018-02-02 10:33:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:33,299 INFO L93 Difference]: Finished difference Result 418 states and 470 transitions. [2018-02-02 10:33:33,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:33:33,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 10:33:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:33,300 INFO L225 Difference]: With dead ends: 418 [2018-02-02 10:33:33,300 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 10:33:33,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=1521, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:33:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 10:33:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 338. [2018-02-02 10:33:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:33:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 10:33:33,303 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 58 [2018-02-02 10:33:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:33,303 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 10:33:33,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:33:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 10:33:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:33:33,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:33,304 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:33,304 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1100381793, now seen corresponding path program 1 times [2018-02-02 10:33:33,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:33,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:33,566 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:33:33,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:33,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:33:33,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:33,567 INFO L182 omatonBuilderFactory]: Interpolants [14320#true, 14321#false, 14322#(= 1 (select |#valid| main_~head~0.base)), 14323#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 14324#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 14325#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 14326#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14327#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 14328#(or (and (= 8 (select |#length| (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))) (= 0 main_~marked~0)), 14329#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14330#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 14331#(and (= |main_#t~mem12.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem12.base|))), 14332#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 14333#(and (= 8 (select |#length| |main_#t~mem20.base|)) (<= |main_#t~mem20.offset| 0)), 14334#(and (<= main_~x~0.offset 0) (= 8 (select |#length| main_~x~0.base))), 14335#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)) (= 8 (select |#length| main_~x~0.base)))] [2018-02-02 10:33:33,567 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:33:33,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:33:33,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:33:33,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:33:33,567 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 16 states. [2018-02-02 10:33:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:34,358 INFO L93 Difference]: Finished difference Result 445 states and 498 transitions. [2018-02-02 10:33:34,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:33:34,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 10:33:34,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:34,359 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:33:34,359 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:33:34,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:33:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 338. [2018-02-02 10:33:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:33:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 10:33:34,362 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 59 [2018-02-02 10:33:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:34,363 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 10:33:34,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:33:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 10:33:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:33:34,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:34,363 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:34,363 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash -567323661, now seen corresponding path program 1 times [2018-02-02 10:33:34,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:34,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:34,571 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:33:34,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:34,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:33:34,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:34,572 INFO L182 omatonBuilderFactory]: Interpolants [15149#true, 15150#false, 15151#(= 1 (select |#valid| main_~head~0.base)), 15152#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 15153#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 15154#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 15155#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15156#(and (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 15157#(or (and (= 8 (select |#length| (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))) (= 0 main_~marked~0)), 15158#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15159#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 15160#(and (= |main_#t~mem12.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select |#length| |main_#t~mem12.base|)) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 8 (select |#length| |main_#t~mem12.base|))), 15161#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15162#(and (<= |main_#t~mem16.offset| 0) (= 8 (select |#length| |main_#t~mem16.base|))), 15163#(and (<= main_~x~0.offset 0) (= 8 (select |#length| main_~x~0.base))), 15164#(and (<= main_~x~0.offset 0) (< 0 (+ main_~x~0.offset 1)) (= 8 (select |#length| main_~x~0.base)))] [2018-02-02 10:33:34,572 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:33:34,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:33:34,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:33:34,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:33:34,573 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 16 states. [2018-02-02 10:33:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:35,345 INFO L93 Difference]: Finished difference Result 453 states and 507 transitions. [2018-02-02 10:33:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:33:35,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 10:33:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:35,347 INFO L225 Difference]: With dead ends: 453 [2018-02-02 10:33:35,347 INFO L226 Difference]: Without dead ends: 453 [2018-02-02 10:33:35,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-02-02 10:33:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 338. [2018-02-02 10:33:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:33:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 386 transitions. [2018-02-02 10:33:35,352 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 386 transitions. Word has length 59 [2018-02-02 10:33:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:35,352 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 386 transitions. [2018-02-02 10:33:35,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:33:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 386 transitions. [2018-02-02 10:33:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:33:35,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:35,353 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] [2018-02-02 10:33:35,353 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 497669479, now seen corresponding path program 1 times [2018-02-02 10:33:35,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:35,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:35,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:35,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:35,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:35,392 INFO L182 omatonBuilderFactory]: Interpolants [15986#true, 15987#false, 15988#(not (= 0 |main_#t~malloc0.base|)), 15989#(not (= 0 main_~head~0.base)), 15990#(not (= 0 main_~x~0.base))] [2018-02-02 10:33:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:35,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:33:35,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:33:35,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:33:35,392 INFO L87 Difference]: Start difference. First operand 338 states and 386 transitions. Second operand 5 states. [2018-02-02 10:33:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:35,472 INFO L93 Difference]: Finished difference Result 367 states and 412 transitions. [2018-02-02 10:33:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:33:35,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-02-02 10:33:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:35,473 INFO L225 Difference]: With dead ends: 367 [2018-02-02 10:33:35,473 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 10:33:35,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:33:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 10:33:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 338. [2018-02-02 10:33:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 10:33:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 384 transitions. [2018-02-02 10:33:35,475 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 384 transitions. Word has length 59 [2018-02-02 10:33:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:35,475 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 384 transitions. [2018-02-02 10:33:35,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:33:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 384 transitions. [2018-02-02 10:33:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:33:35,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:35,476 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:35,476 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1379279270, now seen corresponding path program 2 times [2018-02-02 10:33:35,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:35,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:33:35,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:35,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:33:35,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:35,528 INFO L182 omatonBuilderFactory]: Interpolants [16704#(and (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)) (<= 0 (+ |main_#t~mem20.offset| 4))), 16705#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 4))), 16700#true, 16701#false, 16702#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16703#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 4)))] [2018-02-02 10:33:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:33:35,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:35,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:35,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:35,528 INFO L87 Difference]: Start difference. First operand 338 states and 384 transitions. Second operand 6 states. [2018-02-02 10:33:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:35,741 INFO L93 Difference]: Finished difference Result 357 states and 398 transitions. [2018-02-02 10:33:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:33:35,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-02-02 10:33:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:35,742 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:33:35,742 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 10:33:35,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:33:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 10:33:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 336. [2018-02-02 10:33:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 10:33:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 379 transitions. [2018-02-02 10:33:35,745 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 379 transitions. Word has length 59 [2018-02-02 10:33:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:35,746 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 379 transitions. [2018-02-02 10:33:35,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 379 transitions. [2018-02-02 10:33:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:33:35,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:35,747 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:35,747 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -808443437, now seen corresponding path program 3 times [2018-02-02 10:33:35,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:35,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:36,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:36,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:36,095 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:36,095 INFO L182 omatonBuilderFactory]: Interpolants [17408#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 17409#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 17410#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17411#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 17412#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 17413#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (= 0 main_~marked~0)), 17414#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 17415#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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))), 17416#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 17417#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 17418#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 17419#(and (not (= 0 (select |#valid| main_~head~0.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 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17420#(and (or (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 17421#(and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 17422#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (or (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 17423#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17424#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 17425#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 17426#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17427#(= 1 (select |#valid| |main_#t~mem12.base|)), 17405#true, 17406#false, 17407#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:33:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:36,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:36,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:36,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:36,096 INFO L87 Difference]: Start difference. First operand 336 states and 379 transitions. Second operand 23 states. [2018-02-02 10:33:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:37,350 INFO L93 Difference]: Finished difference Result 445 states and 494 transitions. [2018-02-02 10:33:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:33:37,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-02-02 10:33:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:37,351 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:33:37,351 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:33:37,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=497, Invalid=2155, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:33:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:33:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 336. [2018-02-02 10:33:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 10:33:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 378 transitions. [2018-02-02 10:33:37,355 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 378 transitions. Word has length 60 [2018-02-02 10:33:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:37,356 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 378 transitions. [2018-02-02 10:33:37,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 378 transitions. [2018-02-02 10:33:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:33:37,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:37,357 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:37,357 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -808443436, now seen corresponding path program 3 times [2018-02-02 10:33:37,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:37,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:37,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:37,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:33:37,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:37,996 INFO L182 omatonBuilderFactory]: Interpolants [18267#true, 18268#false, 18269#(= |main_#t~malloc0.offset| 0), 18270#(= main_~head~0.offset 0), 18271#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 18272#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 18273#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 18274#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 18275#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 18276#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 18277#(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)) (= 8 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18278#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 18279#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 18280#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18281#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0)), 18282#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 18283#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18284#(and (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 18285#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 18286#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18287#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem6.offset|)), 18288#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 18289#(and (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 18290#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18291#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18292#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem11.base| 0)))), 18293#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short14|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18294#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18295#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 10:33:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:37,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:33:37,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:33:37,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:33:37,997 INFO L87 Difference]: Start difference. First operand 336 states and 378 transitions. Second operand 29 states. [2018-02-02 10:33:39,506 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 36 DAG size of output 17 [2018-02-02 10:33:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:40,833 INFO L93 Difference]: Finished difference Result 436 states and 483 transitions. [2018-02-02 10:33:40,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:33:40,833 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-02-02 10:33:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:40,834 INFO L225 Difference]: With dead ends: 436 [2018-02-02 10:33:40,834 INFO L226 Difference]: Without dead ends: 436 [2018-02-02 10:33:40,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1070, Invalid=4186, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 10:33:40,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-02 10:33:40,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 301. [2018-02-02 10:33:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 10:33:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 338 transitions. [2018-02-02 10:33:40,837 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 338 transitions. Word has length 60 [2018-02-02 10:33:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:40,837 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 338 transitions. [2018-02-02 10:33:40,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:33:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 338 transitions. [2018-02-02 10:33:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:40,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:40,838 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-02-02 10:33:40,838 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 743414880, now seen corresponding path program 2 times [2018-02-02 10:33:40,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:40,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:41,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:41,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:33:41,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:41,091 INFO L182 omatonBuilderFactory]: Interpolants [19136#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 19137#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 19138#(= 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)))), 19139#(= 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)))), 19140#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 19141#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 19142#(= 1 (select |#valid| |main_#t~mem12.base|)), 19121#true, 19122#false, 19123#(= 1 (select |#valid| main_~head~0.base)), 19124#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 19125#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 19126#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19127#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 19128#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 19129#(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))), 19130#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 19131#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 19132#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 19133#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 19134#(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 (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 19135#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:33:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:41,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:41,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:41,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:41,092 INFO L87 Difference]: Start difference. First operand 301 states and 338 transitions. Second operand 22 states. [2018-02-02 10:33:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:42,620 INFO L93 Difference]: Finished difference Result 557 states and 623 transitions. [2018-02-02 10:33:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:33:42,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-02-02 10:33:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:42,621 INFO L225 Difference]: With dead ends: 557 [2018-02-02 10:33:42,621 INFO L226 Difference]: Without dead ends: 557 [2018-02-02 10:33:42,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=376, Invalid=2486, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:33:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-02 10:33:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 350. [2018-02-02 10:33:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 10:33:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 394 transitions. [2018-02-02 10:33:42,625 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 394 transitions. Word has length 62 [2018-02-02 10:33:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:42,625 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 394 transitions. [2018-02-02 10:33:42,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 394 transitions. [2018-02-02 10:33:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:33:42,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:42,626 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-02-02 10:33:42,626 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 743414881, now seen corresponding path program 1 times [2018-02-02 10:33:42,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:42,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:43,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:43,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:33:43,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:43,045 INFO L182 omatonBuilderFactory]: Interpolants [20128#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|))), 20129#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 20130#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 20131#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 20132#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 20133#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 20134#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8)), 20114#true, 20115#false, 20116#(= 1 (select |#valid| main_~head~0.base)), 20117#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20118#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 20119#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 20120#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 20121#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20122#(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))), 20123#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 20124#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 20125#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 20126#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 20127#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:33:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:43,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:33:43,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:33:43,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:33:43,057 INFO L87 Difference]: Start difference. First operand 350 states and 394 transitions. Second operand 21 states. [2018-02-02 10:33:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:44,531 INFO L93 Difference]: Finished difference Result 556 states and 622 transitions. [2018-02-02 10:33:44,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:33:44,531 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-02-02 10:33:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:44,532 INFO L225 Difference]: With dead ends: 556 [2018-02-02 10:33:44,532 INFO L226 Difference]: Without dead ends: 556 [2018-02-02 10:33:44,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=1662, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:33:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-02 10:33:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 350. [2018-02-02 10:33:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 10:33:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 393 transitions. [2018-02-02 10:33:44,536 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 393 transitions. Word has length 62 [2018-02-02 10:33:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:44,536 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 393 transitions. [2018-02-02 10:33:44,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:33:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 393 transitions. [2018-02-02 10:33:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:33:44,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:44,537 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:44,537 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 563139372, now seen corresponding path program 1 times [2018-02-02 10:33:44,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:44,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:44,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:44,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:33:44,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:44,824 INFO L182 omatonBuilderFactory]: Interpolants [21089#true, 21090#false, 21091#(= 1 (select |#valid| main_~head~0.base)), 21092#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 21093#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 21094#(and (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) (= (select |#valid| main_~x~0.base) 1)), 21095#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21096#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 21097#(or (and (= main_~marked~0 (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))) (= 0 main_~marked~0)), 21098#(and (not (= 0 main_~marked~0)) (= main_~marked~0 (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))), 21099#(and (not (= 0 (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))), 21100#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 21101#(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))), 21102#(and (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 21103#(and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 21104#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 21105#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 21106#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 21107#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 21108#(<= 0 |main_#t~mem20.offset|), 21109#(<= 0 main_~x~0.offset), 21110#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:33:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:44,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:44,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:44,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:44,824 INFO L87 Difference]: Start difference. First operand 350 states and 393 transitions. Second operand 22 states. [2018-02-02 10:33:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:46,044 INFO L93 Difference]: Finished difference Result 460 states and 511 transitions. [2018-02-02 10:33:46,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:33:46,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-02-02 10:33:46,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:46,045 INFO L225 Difference]: With dead ends: 460 [2018-02-02 10:33:46,045 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 10:33:46,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=581, Invalid=2389, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:33:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 10:33:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 358. [2018-02-02 10:33:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 10:33:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2018-02-02 10:33:46,048 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 63 [2018-02-02 10:33:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:46,048 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2018-02-02 10:33:46,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2018-02-02 10:33:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:33:46,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:46,049 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:46,049 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 735867446, now seen corresponding path program 1 times [2018-02-02 10:33:46,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:46,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:46,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:33:46,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:46,070 INFO L182 omatonBuilderFactory]: Interpolants [21995#true, 21996#false, 21997#(not |main_#t~short31|)] [2018-02-02 10:33:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:33:46,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:33:46,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:46,071 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand 3 states. [2018-02-02 10:33:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:46,079 INFO L93 Difference]: Finished difference Result 356 states and 400 transitions. [2018-02-02 10:33:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:33:46,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-02-02 10:33:46,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:46,081 INFO L225 Difference]: With dead ends: 356 [2018-02-02 10:33:46,081 INFO L226 Difference]: Without dead ends: 356 [2018-02-02 10:33:46,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:33:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-02 10:33:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-02-02 10:33:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-02 10:33:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 400 transitions. [2018-02-02 10:33:46,084 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 400 transitions. Word has length 67 [2018-02-02 10:33:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:46,085 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 400 transitions. [2018-02-02 10:33:46,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:33:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 400 transitions. [2018-02-02 10:33:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:33:46,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:46,086 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:46,086 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash -427409840, now seen corresponding path program 1 times [2018-02-02 10:33:46,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:46,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:33:46,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:33:46,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:33:46,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:46,114 INFO L182 omatonBuilderFactory]: Interpolants [22710#true, 22711#false, 22712#(not (= 0 |main_#t~malloc0.base|)), 22713#(not (= 0 main_~head~0.base)), 22714#(not (= 0 main_~x~0.base)), 22715#|main_#t~short31|] [2018-02-02 10:33:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:33:46,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:33:46,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:33:46,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:33:46,115 INFO L87 Difference]: Start difference. First operand 356 states and 400 transitions. Second operand 6 states. [2018-02-02 10:33:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:46,209 INFO L93 Difference]: Finished difference Result 380 states and 424 transitions. [2018-02-02 10:33:46,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:33:46,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-02-02 10:33:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:46,210 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:33:46,210 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:33:46,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:33:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 355. [2018-02-02 10:33:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 10:33:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 398 transitions. [2018-02-02 10:33:46,213 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 398 transitions. Word has length 68 [2018-02-02 10:33:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:46,213 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 398 transitions. [2018-02-02 10:33:46,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:33:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 398 transitions. [2018-02-02 10:33:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:33:46,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:46,214 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] [2018-02-02 10:33:46,214 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1156813523, now seen corresponding path program 1 times [2018-02-02 10:33:46,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:46,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:46,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:33:46,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:46,280 INFO L182 omatonBuilderFactory]: Interpolants [23459#true, 23460#false, 23461#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23462#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 23463#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 23464#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23465#(= 1 (select |#valid| |main_#t~mem34.base|)), 23466#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:33:46,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:33:46,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:33:46,280 INFO L87 Difference]: Start difference. First operand 355 states and 398 transitions. Second operand 8 states. [2018-02-02 10:33:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:46,525 INFO L93 Difference]: Finished difference Result 463 states and 514 transitions. [2018-02-02 10:33:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:33:46,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-02-02 10:33:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:46,526 INFO L225 Difference]: With dead ends: 463 [2018-02-02 10:33:46,526 INFO L226 Difference]: Without dead ends: 463 [2018-02-02 10:33:46,526 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:33:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-02 10:33:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 398. [2018-02-02 10:33:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 10:33:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 447 transitions. [2018-02-02 10:33:46,529 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 447 transitions. Word has length 69 [2018-02-02 10:33:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:46,529 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 447 transitions. [2018-02-02 10:33:46,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:33:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 447 transitions. [2018-02-02 10:33:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:33:46,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:46,529 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] [2018-02-02 10:33:46,530 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1156813524, now seen corresponding path program 1 times [2018-02-02 10:33:46,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:46,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:46,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:33:46,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:46,628 INFO L182 omatonBuilderFactory]: Interpolants [24343#true, 24344#false, 24345#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24346#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc22.offset|)), 24347#(and (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 24348#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24349#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24350#(and (= 0 |main_#t~mem34.offset|) (= 8 (select |#length| |main_#t~mem34.base|))), 24351#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 10:33:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:33:46,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:33:46,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:33:46,628 INFO L87 Difference]: Start difference. First operand 398 states and 447 transitions. Second operand 9 states. [2018-02-02 10:33:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:46,889 INFO L93 Difference]: Finished difference Result 491 states and 544 transitions. [2018-02-02 10:33:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:33:46,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-02-02 10:33:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:46,890 INFO L225 Difference]: With dead ends: 491 [2018-02-02 10:33:46,890 INFO L226 Difference]: Without dead ends: 491 [2018-02-02 10:33:46,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:33:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-02 10:33:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 399. [2018-02-02 10:33:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-02 10:33:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 447 transitions. [2018-02-02 10:33:46,893 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 447 transitions. Word has length 69 [2018-02-02 10:33:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:46,893 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 447 transitions. [2018-02-02 10:33:46,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:33:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 447 transitions. [2018-02-02 10:33:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:33:46,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:46,894 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:46,894 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash -262983341, now seen corresponding path program 1 times [2018-02-02 10:33:46,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:46,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:46,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:33:46,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:46,966 INFO L182 omatonBuilderFactory]: Interpolants [25252#true, 25253#false, 25254#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25255#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~tmp~0.base) 1)), 25256#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 25257#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 25258#(= 1 (select |#valid| |main_#t~mem37.base|)), 25259#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:46,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:33:46,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:33:46,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:33:46,967 INFO L87 Difference]: Start difference. First operand 399 states and 447 transitions. Second operand 8 states. [2018-02-02 10:33:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:47,290 INFO L93 Difference]: Finished difference Result 489 states and 543 transitions. [2018-02-02 10:33:47,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:33:47,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-02-02 10:33:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:47,292 INFO L225 Difference]: With dead ends: 489 [2018-02-02 10:33:47,292 INFO L226 Difference]: Without dead ends: 489 [2018-02-02 10:33:47,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:33:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-02-02 10:33:47,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 415. [2018-02-02 10:33:47,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-02 10:33:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 465 transitions. [2018-02-02 10:33:47,295 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 465 transitions. Word has length 70 [2018-02-02 10:33:47,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:47,295 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 465 transitions. [2018-02-02 10:33:47,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:33:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 465 transitions. [2018-02-02 10:33:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:33:47,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:47,296 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:47,296 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash -262983340, now seen corresponding path program 1 times [2018-02-02 10:33:47,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:47,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:47,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:47,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:33:47,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:47,405 INFO L182 omatonBuilderFactory]: Interpolants [26179#true, 26180#false, 26181#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26182#(and (= 8 (select |#length| |main_#t~malloc22.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc22.offset|)), 26183#(and (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 26184#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26185#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26186#(and (= 0 |main_#t~mem37.offset|) (= 8 (select |#length| |main_#t~mem37.base|))), 26187#(and (= (select |#length| main_~x~0.base) 8) (= 0 main_~x~0.offset))] [2018-02-02 10:33:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:33:47,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:33:47,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:33:47,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:33:47,406 INFO L87 Difference]: Start difference. First operand 415 states and 465 transitions. Second operand 9 states. [2018-02-02 10:33:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:47,685 INFO L93 Difference]: Finished difference Result 499 states and 552 transitions. [2018-02-02 10:33:47,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:33:47,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 10:33:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:47,686 INFO L225 Difference]: With dead ends: 499 [2018-02-02 10:33:47,686 INFO L226 Difference]: Without dead ends: 499 [2018-02-02 10:33:47,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:33:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-02-02 10:33:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 412. [2018-02-02 10:33:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-02-02 10:33:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 460 transitions. [2018-02-02 10:33:47,689 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 460 transitions. Word has length 70 [2018-02-02 10:33:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:47,689 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 460 transitions. [2018-02-02 10:33:47,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:33:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 460 transitions. [2018-02-02 10:33:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:33:47,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:47,690 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2018-02-02 10:33:47,690 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2022813450, now seen corresponding path program 2 times [2018-02-02 10:33:47,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:47,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:47,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:47,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:33:47,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:47,954 INFO L182 omatonBuilderFactory]: Interpolants [27109#true, 27110#false, 27111#(= 1 (select |#valid| main_~head~0.base)), 27112#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 27113#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 27114#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 27115#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 27116#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 27117#(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))), 27118#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 27119#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 27120#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 27121#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 27122#(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 (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 27123#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 27124#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 27125#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (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)))), 27126#(= 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)))), 27127#(= 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)))), 27128#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 27129#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27130#(= 1 (select |#valid| |main_#t~mem20.base|)), 27131#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:33:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:47,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:33:47,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:33:47,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:33:47,955 INFO L87 Difference]: Start difference. First operand 412 states and 460 transitions. Second operand 23 states. [2018-02-02 10:33:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:49,375 INFO L93 Difference]: Finished difference Result 615 states and 684 transitions. [2018-02-02 10:33:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:33:49,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-02-02 10:33:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:49,376 INFO L225 Difference]: With dead ends: 615 [2018-02-02 10:33:49,376 INFO L226 Difference]: Without dead ends: 615 [2018-02-02 10:33:49,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=2520, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:33:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-02 10:33:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 432. [2018-02-02 10:33:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-02-02 10:33:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 485 transitions. [2018-02-02 10:33:49,380 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 485 transitions. Word has length 70 [2018-02-02 10:33:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:49,380 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 485 transitions. [2018-02-02 10:33:49,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:33:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 485 transitions. [2018-02-02 10:33:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:33:49,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:49,381 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2018-02-02 10:33:49,381 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2022813451, now seen corresponding path program 1 times [2018-02-02 10:33:49,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:49,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:49,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:49,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:33:49,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:49,664 INFO L182 omatonBuilderFactory]: Interpolants [28256#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 28257#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 28258#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 28259#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 28260#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 28261#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 28262#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28263#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 28264#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 28243#true, 28244#false, 28245#(= 1 (select |#valid| main_~head~0.base)), 28246#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 28247#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 28248#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 28249#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 28250#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 28251#(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))), 28252#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 28253#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 28254#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 28255#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|)))] [2018-02-02 10:33:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:49,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:33:49,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:33:49,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:33:49,664 INFO L87 Difference]: Start difference. First operand 432 states and 485 transitions. Second operand 22 states. [2018-02-02 10:33:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:51,304 INFO L93 Difference]: Finished difference Result 631 states and 702 transitions. [2018-02-02 10:33:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:33:51,305 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 70 [2018-02-02 10:33:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:51,306 INFO L225 Difference]: With dead ends: 631 [2018-02-02 10:33:51,306 INFO L226 Difference]: Without dead ends: 631 [2018-02-02 10:33:51,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:33:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-02-02 10:33:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 439. [2018-02-02 10:33:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-02-02 10:33:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 493 transitions. [2018-02-02 10:33:51,310 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 493 transitions. Word has length 70 [2018-02-02 10:33:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:51,310 INFO L432 AbstractCegarLoop]: Abstraction has 439 states and 493 transitions. [2018-02-02 10:33:51,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:33:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 493 transitions. [2018-02-02 10:33:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:33:51,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:51,310 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] [2018-02-02 10:33:51,310 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1747894606, now seen corresponding path program 1 times [2018-02-02 10:33:51,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:51,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:33:51,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:51,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:33:51,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:51,384 INFO L182 omatonBuilderFactory]: Interpolants [29392#(<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)), 29393#(<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)), 29394#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base)))), 29395#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)) (not (= 0 (select |#valid| main_~x~0.base)))), 29396#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1))), 29387#true, 29388#false, 29389#(= main_~marked~0 1), 29390#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 29391#(<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:33:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:33:51,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:33:51,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:33:51,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:33:51,385 INFO L87 Difference]: Start difference. First operand 439 states and 493 transitions. Second operand 10 states. [2018-02-02 10:33:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:51,611 INFO L93 Difference]: Finished difference Result 506 states and 562 transitions. [2018-02-02 10:33:51,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:33:51,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-02 10:33:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:51,613 INFO L225 Difference]: With dead ends: 506 [2018-02-02 10:33:51,613 INFO L226 Difference]: Without dead ends: 506 [2018-02-02 10:33:51,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:33:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-02-02 10:33:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 424. [2018-02-02 10:33:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-02-02 10:33:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 473 transitions. [2018-02-02 10:33:51,616 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 473 transitions. Word has length 71 [2018-02-02 10:33:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:51,616 INFO L432 AbstractCegarLoop]: Abstraction has 424 states and 473 transitions. [2018-02-02 10:33:51,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:33:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 473 transitions. [2018-02-02 10:33:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:33:51,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:51,616 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:51,616 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 560170888, now seen corresponding path program 2 times [2018-02-02 10:33:51,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:51,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:51,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:51,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:33:51,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:51,885 INFO L182 omatonBuilderFactory]: Interpolants [30341#true, 30342#false, 30343#(= 1 (select |#valid| main_~head~0.base)), 30344#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 30345#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 30346#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30347#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 30348#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 30349#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 30350#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1)), 30351#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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))), 30352#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 30353#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 30354#(not (= |main_#t~mem6.base| main_~head~0.base)), 30355#(not (= main_~x~0.base main_~head~0.base)), 30356#(and (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30357#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 30358#(and (not (= 0 (select |#valid| |main_#t~mem16.base|))) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|))), 30359#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base)))), 30360#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)) (not (= 0 (select |#valid| main_~x~0.base)))), 30361#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)))] [2018-02-02 10:33:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:51,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:33:51,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:33:51,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:33:51,886 INFO L87 Difference]: Start difference. First operand 424 states and 473 transitions. Second operand 21 states. [2018-02-02 10:33:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:53,657 INFO L93 Difference]: Finished difference Result 578 states and 633 transitions. [2018-02-02 10:33:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 10:33:53,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-02 10:33:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:53,658 INFO L225 Difference]: With dead ends: 578 [2018-02-02 10:33:53,658 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 10:33:53,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=753, Invalid=4217, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 10:33:53,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 10:33:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 383. [2018-02-02 10:33:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 10:33:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 423 transitions. [2018-02-02 10:33:53,662 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 423 transitions. Word has length 71 [2018-02-02 10:33:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:53,662 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 423 transitions. [2018-02-02 10:33:53,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:33:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 423 transitions. [2018-02-02 10:33:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:33:53,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:53,663 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:53,663 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 755338483, now seen corresponding path program 3 times [2018-02-02 10:33:53,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:53,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:53,970 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:53,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:33:53,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:53,970 INFO L182 omatonBuilderFactory]: Interpolants [31456#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 31433#true, 31434#false, 31435#(= 1 (select |#valid| main_~head~0.base)), 31436#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 31437#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 31438#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 31439#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 31440#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 31441#(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))), 31442#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 31443#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 31444#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 31445#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|)), 31446#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 31447#(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) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 31448#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 31449#(= 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))), 31450#(= 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))), 31451#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)), 31452#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 31453#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31454#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 31455#(and (<= 0 |main_#t~mem16.offset|) (<= (+ |main_#t~mem16.offset| 8) (select |#length| |main_#t~mem16.base|)))] [2018-02-02 10:33:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:53,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:33:53,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:33:53,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:33:53,971 INFO L87 Difference]: Start difference. First operand 383 states and 423 transitions. Second operand 24 states. [2018-02-02 10:33:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:55,593 INFO L93 Difference]: Finished difference Result 624 states and 689 transitions. [2018-02-02 10:33:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:33:55,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-02-02 10:33:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:55,595 INFO L225 Difference]: With dead ends: 624 [2018-02-02 10:33:55,595 INFO L226 Difference]: Without dead ends: 624 [2018-02-02 10:33:55,596 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=2823, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:33:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-02-02 10:33:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 385. [2018-02-02 10:33:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-02-02 10:33:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 426 transitions. [2018-02-02 10:33:55,599 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 426 transitions. Word has length 72 [2018-02-02 10:33:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:55,599 INFO L432 AbstractCegarLoop]: Abstraction has 385 states and 426 transitions. [2018-02-02 10:33:55,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:33:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 426 transitions. [2018-02-02 10:33:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:33:55,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:55,600 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:55,600 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1005697877, now seen corresponding path program 3 times [2018-02-02 10:33:55,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:55,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:56,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:56,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:33:56,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:56,009 INFO L182 omatonBuilderFactory]: Interpolants [32544#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 32545#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 32546#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 32547#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 32548#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base main_~head~0.base))), 32549#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc4.base|))), 32550#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 32551#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 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))))), 32552#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 32553#(= 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)))), 32554#(= 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)))), 32555#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 32556#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 32557#(= 1 (select |#valid| |main_#t~mem12.base|)), 32534#true, 32535#false, 32536#(= 1 (select |#valid| main_~head~0.base)), 32537#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 32538#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 32539#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 32540#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 32541#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 32542#(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))), 32543#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base)))] [2018-02-02 10:33:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:56,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:33:56,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:33:56,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:33:56,009 INFO L87 Difference]: Start difference. First operand 385 states and 426 transitions. Second operand 24 states. [2018-02-02 10:33:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:33:57,479 INFO L93 Difference]: Finished difference Result 634 states and 694 transitions. [2018-02-02 10:33:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:33:57,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-02-02 10:33:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:33:57,480 INFO L225 Difference]: With dead ends: 634 [2018-02-02 10:33:57,480 INFO L226 Difference]: Without dead ends: 634 [2018-02-02 10:33:57,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:33:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-02 10:33:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 434. [2018-02-02 10:33:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:33:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 482 transitions. [2018-02-02 10:33:57,485 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 482 transitions. Word has length 74 [2018-02-02 10:33:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:33:57,485 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 482 transitions. [2018-02-02 10:33:57,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:33:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 482 transitions. [2018-02-02 10:33:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:33:57,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:33:57,486 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:33:57,486 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:33:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1005697876, now seen corresponding path program 2 times [2018-02-02 10:33:57,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:33:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:33:57,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:33:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:58,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:33:58,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:33:58,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:33:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:58,123 INFO L182 omatonBuilderFactory]: Interpolants [33682#true, 33683#false, 33684#(= |main_#t~malloc0.offset| 0), 33685#(= main_~head~0.offset 0), 33686#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 33687#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33688#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 33689#(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) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 33690#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 33691#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33692#(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)) (= main_~head~0.offset 0)), 33693#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base))), 33694#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33695#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 33696#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 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) (= (select |#valid| main_~x~0.base) 1)), 33697#(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 (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| |main_#t~mem6.base|)) (= main_~head~0.offset 0)), 33698#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 33699#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (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 (= 0 (select |#valid| main_~x~0.base))) (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))) (= main_~head~0.offset 0)), 33700#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (= 8 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~malloc4.base| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)))), 33701#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 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)))), 33702#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem6.offset|)), 33703#(or (and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 33704#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~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))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 33705#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 33706#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 33707#(or (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))))), 33708#(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))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))) (not |main_#t~short14|)), 33709#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 33710#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 33711#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 33712#(and (= |main_#t~mem12.offset| 0) (= (select |#length| |main_#t~mem12.base|) 8))] [2018-02-02 10:33:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:33:58,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:33:58,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:33:58,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:33:58,124 INFO L87 Difference]: Start difference. First operand 434 states and 482 transitions. Second operand 31 states. [2018-02-02 10:34:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:00,455 INFO L93 Difference]: Finished difference Result 592 states and 650 transitions. [2018-02-02 10:34:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:34:00,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 74 [2018-02-02 10:34:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:00,456 INFO L225 Difference]: With dead ends: 592 [2018-02-02 10:34:00,456 INFO L226 Difference]: Without dead ends: 592 [2018-02-02 10:34:00,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=745, Invalid=4511, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 10:34:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-02-02 10:34:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 434. [2018-02-02 10:34:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:34:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 10:34:00,460 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 74 [2018-02-02 10:34:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:00,460 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 10:34:00,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:34:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 10:34:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:34:00,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:00,460 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 10:34:00,460 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash -456539016, now seen corresponding path program 4 times [2018-02-02 10:34:00,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:00,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:01,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:01,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:34:01,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:01,017 INFO L182 omatonBuilderFactory]: Interpolants [34823#true, 34824#false, 34825#(= 1 (select |#valid| main_~head~0.base)), 34826#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 34827#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 34828#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 34829#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 34830#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 34831#(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))), 34832#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 34833#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 34834#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 34835#(and (not (= |main_#t~malloc4.base| main_~x~0.base)) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 34836#(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_~head~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_~x~0.base))), 34837#(and (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= main_~head~0.base |main_#t~mem6.base|)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 34838#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 34839#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34840#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 34841#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 34842#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)))), 34843#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 34844#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem16.base|) |main_#t~mem16.offset|))), 34845#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 34846#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0)), 34847#(not |main_#t~short14|)] [2018-02-02 10:34:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:01,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:34:01,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:34:01,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:34:01,018 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 25 states. [2018-02-02 10:34:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:03,762 INFO L93 Difference]: Finished difference Result 611 states and 673 transitions. [2018-02-02 10:34:03,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:34:03,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-02-02 10:34:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:03,763 INFO L225 Difference]: With dead ends: 611 [2018-02-02 10:34:03,763 INFO L226 Difference]: Without dead ends: 611 [2018-02-02 10:34:03,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=474, Invalid=3816, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:34:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-02 10:34:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 434. [2018-02-02 10:34:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:34:03,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 10:34:03,766 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 76 [2018-02-02 10:34:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:03,766 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 10:34:03,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:34:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 10:34:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:34:03,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:03,767 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:03,767 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2019274260, now seen corresponding path program 1 times [2018-02-02 10:34:03,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:03,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:04,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:04,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:34:04,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:04,126 INFO L182 omatonBuilderFactory]: Interpolants [35975#true, 35976#false, 35977#(= 1 (select |#valid| main_~head~0.base)), 35978#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 35979#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 35980#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 35981#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 35982#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 35983#(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))), 35984#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 35985#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 35986#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 35987#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|)), 35988#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 35989#(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) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base))), 35990#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 35991#(= 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))), 35992#(= 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))), 35993#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset|)), 35994#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 35995#(and (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 35996#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 35997#(<= 0 |main_#t~mem20.offset|), 35998#(<= 0 main_~x~0.offset), 35999#(and (<= (+ main_~x~0.offset 8) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:34:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:04,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:34:04,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:34:04,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:34:04,126 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 25 states. [2018-02-02 10:34:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:06,266 INFO L93 Difference]: Finished difference Result 615 states and 679 transitions. [2018-02-02 10:34:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-02 10:34:06,266 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-02-02 10:34:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:06,267 INFO L225 Difference]: With dead ends: 615 [2018-02-02 10:34:06,267 INFO L226 Difference]: Without dead ends: 615 [2018-02-02 10:34:06,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1099, Invalid=5543, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 10:34:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-02-02 10:34:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 434. [2018-02-02 10:34:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:34:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 10:34:06,270 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 77 [2018-02-02 10:34:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:06,270 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 10:34:06,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:34:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 10:34:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:34:06,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:06,271 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:06,271 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1707826939, now seen corresponding path program 1 times [2018-02-02 10:34:06,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:06,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:34:06,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:06,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:34:06,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:06,310 INFO L182 omatonBuilderFactory]: Interpolants [37168#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 37169#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 37170#(not (= |main_#t~mem37.base| 0)), 37171#(not (= main_~x~0.base 0)), 37163#true, 37164#false, 37165#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 37166#(and (not (= |main_#t~malloc22.base| 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 37167#(and (not (= main_~tmp~0.base 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:34:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:34:06,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:34:06,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:34:06,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:06,311 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 9 states. [2018-02-02 10:34:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:06,468 INFO L93 Difference]: Finished difference Result 528 states and 579 transitions. [2018-02-02 10:34:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:34:06,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-02-02 10:34:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:06,469 INFO L225 Difference]: With dead ends: 528 [2018-02-02 10:34:06,469 INFO L226 Difference]: Without dead ends: 528 [2018-02-02 10:34:06,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-02 10:34:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 434. [2018-02-02 10:34:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:34:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 10:34:06,472 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 78 [2018-02-02 10:34:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:06,472 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 10:34:06,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:34:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 10:34:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:34:06,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:06,473 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:06,473 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1992171755, now seen corresponding path program 1 times [2018-02-02 10:34:06,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:06,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:34:06,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:06,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:34:06,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:06,545 INFO L182 omatonBuilderFactory]: Interpolants [38144#true, 38145#false, 38146#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38147#(and (not (= |main_#t~malloc22.base| 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38148#(and (not (= main_~tmp~0.base 0)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 38149#(not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)), 38150#(not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)), 38151#(not (= |main_#t~mem34.base| 0)), 38152#(not (= main_~x~0.base 0))] [2018-02-02 10:34:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:34:06,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:34:06,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:34:06,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:34:06,545 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 9 states. [2018-02-02 10:34:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:06,734 INFO L93 Difference]: Finished difference Result 529 states and 579 transitions. [2018-02-02 10:34:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:34:06,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-02-02 10:34:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:06,735 INFO L225 Difference]: With dead ends: 529 [2018-02-02 10:34:06,736 INFO L226 Difference]: Without dead ends: 529 [2018-02-02 10:34:06,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:34:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-02-02 10:34:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 429. [2018-02-02 10:34:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 10:34:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 474 transitions. [2018-02-02 10:34:06,739 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 474 transitions. Word has length 80 [2018-02-02 10:34:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:06,739 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 474 transitions. [2018-02-02 10:34:06,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:34:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 474 transitions. [2018-02-02 10:34:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:34:06,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:06,739 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:06,740 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1015169157, now seen corresponding path program 3 times [2018-02-02 10:34:06,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:06,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:07,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:07,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:34:07,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:07,169 INFO L182 omatonBuilderFactory]: Interpolants [39121#true, 39122#false, 39123#(= 1 (select |#valid| main_~head~0.base)), 39124#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 39125#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 39126#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 39127#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 39128#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 39129#(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))), 39130#(or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 39131#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 39132#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 39133#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base))), 39134#(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 (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))), 39135#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) |main_#t~mem6.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 39136#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 39137#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39138#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 39139#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 39140#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|)))), 39141#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 39142#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 39143#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 39144#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 39145#(not |main_#t~short19|)] [2018-02-02 10:34:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:07,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:34:07,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:34:07,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:34:07,170 INFO L87 Difference]: Start difference. First operand 429 states and 474 transitions. Second operand 25 states. [2018-02-02 10:34:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:09,092 INFO L93 Difference]: Finished difference Result 616 states and 676 transitions. [2018-02-02 10:34:09,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:34:09,092 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-02 10:34:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:09,093 INFO L225 Difference]: With dead ends: 616 [2018-02-02 10:34:09,094 INFO L226 Difference]: Without dead ends: 616 [2018-02-02 10:34:09,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=498, Invalid=4058, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:34:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-02-02 10:34:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 434. [2018-02-02 10:34:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-02 10:34:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2018-02-02 10:34:09,097 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 81 [2018-02-02 10:34:09,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:09,097 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2018-02-02 10:34:09,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:34:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2018-02-02 10:34:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:34:09,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:09,098 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:09,098 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash -885728171, now seen corresponding path program 4 times [2018-02-02 10:34:09,098 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:09,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:09,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:09,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:34:09,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:09,769 INFO L182 omatonBuilderFactory]: Interpolants [40282#true, 40283#false, 40284#(= |main_#t~malloc0.offset| 0), 40285#(= main_~head~0.offset 0), 40286#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 40287#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 40288#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= |main_#t~malloc4.offset| 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 40289#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40290#(and (= |main_#t~mem6.offset| 0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 40291#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 40292#(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)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40293#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))) (= 0 main_~marked~0)), 40294#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~marked~0 1) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))), 40295#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40296#(and (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= main_~head~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 40297#(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))) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 40298#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= main_~head~0.offset 0)), 40299#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 40300#(and (= main_~head~0.offset |main_#t~malloc4.offset|) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 40301#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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)) 0)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= (select |#valid| main_~x~0.base) 1)), 40302#(and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= main_~head~0.offset |main_#t~mem6.offset|)), 40303#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (not (= main_~x~0.base main_~head~0.base)))) (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))))), 40304#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))) (or (and (not (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 40305#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)))) (or (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))), 40306#(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)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 40307#(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)))) (and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.base| 0))), 40308#(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 |main_#t~short14|)), 40309#(= 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)))), 40310#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 40311#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 40312#(= 1 (select |#valid| |main_#t~mem20.base|)), 40313#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:34:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:09,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:34:09,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:34:09,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:34:09,769 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand 32 states. [2018-02-02 10:34:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:34:13,784 INFO L93 Difference]: Finished difference Result 696 states and 768 transitions. [2018-02-02 10:34:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-02 10:34:13,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 82 [2018-02-02 10:34:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:34:13,786 INFO L225 Difference]: With dead ends: 696 [2018-02-02 10:34:13,786 INFO L226 Difference]: Without dead ends: 696 [2018-02-02 10:34:13,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2835 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1554, Invalid=8546, Unknown=0, NotChecked=0, Total=10100 [2018-02-02 10:34:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-02 10:34:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 454. [2018-02-02 10:34:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-02-02 10:34:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 506 transitions. [2018-02-02 10:34:13,790 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 506 transitions. Word has length 82 [2018-02-02 10:34:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:34:13,790 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 506 transitions. [2018-02-02 10:34:13,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:34:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 506 transitions. [2018-02-02 10:34:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:34:13,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:34:13,790 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:34:13,790 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr62EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:34:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -885728170, now seen corresponding path program 2 times [2018-02-02 10:34:13,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:34:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:34:13,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:34:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:14,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:34:14,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:34:14,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:34:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:14,364 INFO L182 omatonBuilderFactory]: Interpolants [41602#true, 41603#false, 41604#(= 1 (select |#valid| main_~head~0.base)), 41605#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 41606#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|)), 41607#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 41608#(and (= |main_#t~mem6.offset| 0) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)), 41609#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41610#(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)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41611#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 41612#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~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))), 41613#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= |main_#t~malloc4.base| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc4.base| main_~head~0.base)) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 41614#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (= (select |#valid| main_~x~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 41615#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= |main_#t~mem6.base| main_~head~0.base)) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41616#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41617#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (not (= 0 (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 (= 0 (select |#valid| main_~x~0.base))) (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)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41618#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset) |main_#t~malloc4.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 41619#(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))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41620#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~head~0.base |main_#t~mem6.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41621#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 41622#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 41623#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 41624#(and (= |main_#t~mem11.offset| 0) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 41625#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 41626#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) |main_#t~mem20.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) |main_#t~mem20.offset|))), 41627#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 41628#(and (= 0 |main_#t~mem20.offset|) (= 8 (select |#length| |main_#t~mem20.base|))), 41629#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-02 10:34:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:34:14,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:34:14,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:34:14,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:34:14,365 INFO L87 Difference]: Start difference. First operand 454 states and 506 transitions. Second operand 28 states. Received shutdown request... [2018-02-02 10:34:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:34:15,413 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:34:15,418 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:34:15,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:34:15 BoogieIcfgContainer [2018-02-02 10:34:15,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:34:15,419 INFO L168 Benchmark]: Toolchain (without parser) took 56050.31 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 889.7 MB). Free memory was 357.4 MB in the beginning and 775.5 MB in the end (delta: -418.1 MB). Peak memory consumption was 471.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:15,420 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:34:15,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.87 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.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:34:15,420 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 341.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:15,421 INFO L168 Benchmark]: RCFGBuilder took 418.11 ms. Allocated memory is still 400.6 MB. Free memory was 341.6 MB in the beginning and 298.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:15,421 INFO L168 Benchmark]: TraceAbstraction took 55422.14 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 889.7 MB). Free memory was 298.4 MB in the beginning and 775.5 MB in the end (delta: -477.1 MB). Peak memory consumption was 412.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:34:15,422 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 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.87 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.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 31.30 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 341.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 418.11 ms. Allocated memory is still 400.6 MB. Free memory was 341.6 MB in the beginning and 298.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55422.14 ms. Allocated memory was 400.6 MB in the beginning and 1.3 GB in the end (delta: 889.7 MB). Free memory was 298.4 MB in the beginning and 775.5 MB in the end (delta: -477.1 MB). Peak memory consumption was 412.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 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 (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1061). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was constructing difference of abstraction (454states) and interpolant automaton (currently 24 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (150 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 169 locations, 63 error locations. TIMEOUT Result, 55.3s OverallTime, 51 OverallIterations, 4 TraceHistogramMax, 44.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5985 SDtfs, 32742 SDslu, 44036 SDs, 0 SdLazy, 48396 SolverSat, 4373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1691 GetRequests, 127 SyntacticMatches, 53 SemanticMatches, 1511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18920 ImplicationChecksByTransitivity, 28.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 117/829 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 5856 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2812 NumberOfCodeBlocks, 2812 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2761 ConstructedInterpolants, 0 QuantifiedInterpolants, 2789690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 17 PerfectInterpolantSequences, 117/829 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-34-15-429.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-34-15-429.csv Completed graceful shutdown