java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:29:05,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:29:05,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:29:06,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:29:06,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:29:06,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:29:06,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:29:06,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:29:06,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:29:06,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:29:06,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:29:06,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:29:06,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:29:06,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:29:06,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:29:06,013 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:29:06,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:29:06,016 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:29:06,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:29:06,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:29:06,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:29:06,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:29:06,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:29:06,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:29:06,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:29:06,023 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:29:06,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:29:06,024 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:29:06,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:29:06,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:29:06,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:29:06,025 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:29:06,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:29:06,033 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:29:06,034 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:29:06,034 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:29:06,034 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:29:06,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:29:06,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:29:06,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:29:06,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:29:06,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:29:06,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:29:06,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:29:06,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:29:06,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:29:06,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:29:06,071 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:29:06,074 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:29:06,075 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:29:06,075 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:29:06,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:29:06,213 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:29:06,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:29:06,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:29:06,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:29:06,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:29:06,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dc9dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06, skipping insertion in model container [2018-02-02 10:29:06,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,232 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:29:06,262 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:29:06,363 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:29:06,383 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:29:06,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06 WrapperNode [2018-02-02 10:29:06,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:29:06,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:29:06,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:29:06,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:29:06,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (1/1) ... [2018-02-02 10:29:06,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:29:06,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:29:06,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:29:06,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:29:06,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (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:29:06,464 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:29:06,464 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:29:06,464 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:29:06,464 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:29:06,465 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:29:06,827 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:29:06,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:29:06 BoogieIcfgContainer [2018-02-02 10:29:06,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:29:06,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:29:06,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:29:06,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:29:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:29:06" (1/3) ... [2018-02-02 10:29:06,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4d5de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:29:06, skipping insertion in model container [2018-02-02 10:29:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:06" (2/3) ... [2018-02-02 10:29:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4d5de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:29:06, skipping insertion in model container [2018-02-02 10:29:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:29:06" (3/3) ... [2018-02-02 10:29:06,832 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:29:06,837 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:29:06,843 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-02-02 10:29:06,868 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:29:06,869 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:29:06,869 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:29:06,869 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:29:06,869 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:29:06,869 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:29:06,870 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:29:06,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:29:06,871 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:29:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-02-02 10:29:06,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:29:06,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:06,890 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:06,891 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 484042676, now seen corresponding path program 1 times [2018-02-02 10:29:06,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:06,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:07,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:07,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,013 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| main_~head~0.base)), 157#true, 158#false, 159#(= 1 (select |#valid| |main_#t~malloc0.base|))] [2018-02-02 10:29:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:07,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:07,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:07,024 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2018-02-02 10:29:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:07,250 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-02-02 10:29:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:07,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:29:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:07,262 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:29:07,262 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:29:07,263 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:29:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:29:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-02-02 10:29:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:29:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-02-02 10:29:07,295 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 8 [2018-02-02 10:29:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:07,295 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-02-02 10:29:07,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-02-02 10:29:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:29:07,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:07,296 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:07,296 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash 484042677, now seen corresponding path program 1 times [2018-02-02 10:29:07,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:07,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:07,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:07,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,353 INFO L182 omatonBuilderFactory]: Interpolants [475#true, 476#false, 477#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 478#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 10:29:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:07,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:07,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:07,355 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 4 states. [2018-02-02 10:29:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:07,441 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-02-02 10:29:07,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:07,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:29:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:07,443 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:29:07,443 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:29:07,444 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:29:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:29:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:29:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:29:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-02-02 10:29:07,452 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 8 [2018-02-02 10:29:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:07,452 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-02-02 10:29:07,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-02-02 10:29:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:29:07,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:07,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:07,453 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1645542977, now seen corresponding path program 1 times [2018-02-02 10:29:07,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:07,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:07,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:07,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,523 INFO L182 omatonBuilderFactory]: Interpolants [771#true, 772#false, 773#(= 1 (select |#valid| main_~head~0.base)), 774#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:07,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:07,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:07,524 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 4 states. [2018-02-02 10:29:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:07,649 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-02-02 10:29:07,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:07,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:29:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:07,650 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:29:07,650 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:29:07,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:29:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-02-02 10:29:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:29:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2018-02-02 10:29:07,657 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 16 [2018-02-02 10:29:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:07,658 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2018-02-02 10:29:07,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2018-02-02 10:29:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:29:07,658 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:07,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:07,659 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1645542978, now seen corresponding path program 1 times [2018-02-02 10:29:07,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:07,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:07,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:29:07,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,742 INFO L182 omatonBuilderFactory]: Interpolants [1049#true, 1050#false, 1051#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1052#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 1053#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 1054#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 1055#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:07,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:07,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:07,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:07,743 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 7 states. [2018-02-02 10:29:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:07,987 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-02-02 10:29:07,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:29:07,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 10:29:07,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:07,988 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:29:07,988 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:29:07,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 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:29:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:29:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2018-02-02 10:29:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:29:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 184 transitions. [2018-02-02 10:29:07,993 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 184 transitions. Word has length 16 [2018-02-02 10:29:07,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:07,993 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 184 transitions. [2018-02-02 10:29:07,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 184 transitions. [2018-02-02 10:29:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:29:07,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:07,994 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:29:07,994 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash 818835877, now seen corresponding path program 1 times [2018-02-02 10:29:07,995 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:08,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:08,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:08,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,043 INFO L182 omatonBuilderFactory]: Interpolants [1409#true, 1410#false, 1411#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1412#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1413#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-02 10:29:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:08,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:08,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:08,044 INFO L87 Difference]: Start difference. First operand 166 states and 184 transitions. Second operand 5 states. [2018-02-02 10:29:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:08,294 INFO L93 Difference]: Finished difference Result 291 states and 322 transitions. [2018-02-02 10:29:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:29:08,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:29:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:08,295 INFO L225 Difference]: With dead ends: 291 [2018-02-02 10:29:08,295 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 10:29:08,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:29:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 10:29:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 165. [2018-02-02 10:29:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:29:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2018-02-02 10:29:08,302 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 18 [2018-02-02 10:29:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:08,302 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2018-02-02 10:29:08,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2018-02-02 10:29:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:29:08,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:08,303 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:29:08,303 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash 818835876, now seen corresponding path program 1 times [2018-02-02 10:29:08,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:08,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:08,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:08,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,346 INFO L182 omatonBuilderFactory]: Interpolants [1876#true, 1877#false, 1878#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1879#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1880#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 10:29:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:08,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:08,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:08,347 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand 5 states. [2018-02-02 10:29:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:08,518 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2018-02-02 10:29:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:08,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:29:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:08,520 INFO L225 Difference]: With dead ends: 290 [2018-02-02 10:29:08,520 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 10:29:08,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 10:29:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 164. [2018-02-02 10:29:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:29:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2018-02-02 10:29:08,524 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 18 [2018-02-02 10:29:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:08,525 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2018-02-02 10:29:08,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2018-02-02 10:29:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:29:08,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:08,525 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:08,525 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1530293414, now seen corresponding path program 1 times [2018-02-02 10:29:08,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:08,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:08,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:29:08,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,605 INFO L182 omatonBuilderFactory]: Interpolants [2339#true, 2340#false, 2341#(= 1 (select |#valid| main_~head~0.base)), 2342#(= (select |#valid| main_~x~0.base) 1), 2343#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 2344#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 2345#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 2346#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2347#(= 1 (select |#valid| |main_#t~mem9.base|))] [2018-02-02 10:29:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:08,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:29:08,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:29:08,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:08,606 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 9 states. [2018-02-02 10:29:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:08,934 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2018-02-02 10:29:08,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:08,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:29:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:08,936 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:29:08,936 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:29:08,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:29:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:29:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-02-02 10:29:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:29:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2018-02-02 10:29:08,941 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 22 [2018-02-02 10:29:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:08,941 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2018-02-02 10:29:08,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:29:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2018-02-02 10:29:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:29:08,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:08,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:08,943 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1530293415, now seen corresponding path program 1 times [2018-02-02 10:29:08,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:08,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:09,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:29:09,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,075 INFO L182 omatonBuilderFactory]: Interpolants [2688#(= 1 (select |#valid| main_~head~0.base)), 2689#(= (select |#valid| main_~x~0.base) 1), 2690#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 2691#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2692#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2693#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2694#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 2695#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 2686#true, 2687#false] [2018-02-02 10:29:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:09,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:09,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:09,076 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 10 states. [2018-02-02 10:29:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:09,669 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-02-02 10:29:09,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:29:09,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:29:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:09,670 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:29:09,671 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:29:09,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:29:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2018-02-02 10:29:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:29:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2018-02-02 10:29:09,674 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 22 [2018-02-02 10:29:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:09,675 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2018-02-02 10:29:09,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2018-02-02 10:29:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:29:09,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:09,676 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:09,676 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1318343963, now seen corresponding path program 1 times [2018-02-02 10:29:09,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:09,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:09,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:29:09,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,765 INFO L182 omatonBuilderFactory]: Interpolants [3029#true, 3030#false, 3031#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4) 0) main_~head~0.offset))), 3032#(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))), 3033#(and (= |main_#t~mem12.offset| 0) (= 0 |main_#t~mem12.base|)), 3034#(not |main_#t~short14|)] [2018-02-02 10:29:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:09,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:09,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:09,766 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand 6 states. [2018-02-02 10:29:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:09,895 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2018-02-02 10:29:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:29:09,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:29:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:09,896 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:29:09,896 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:29:09,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:29:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2018-02-02 10:29:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:29:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-02-02 10:29:09,900 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 27 [2018-02-02 10:29:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:09,900 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-02-02 10:29:09,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2018-02-02 10:29:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:29:09,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:09,901 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:09,901 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 421020147, now seen corresponding path program 1 times [2018-02-02 10:29:09,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:09,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:09,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:29:09,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:09,970 INFO L182 omatonBuilderFactory]: Interpolants [3376#false, 3377#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem12.base|) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3378#(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)))), 3379#(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))), 3380#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)), 3375#true] [2018-02-02 10:29:09,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:29:09,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:09,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:09,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:09,970 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 6 states. [2018-02-02 10:29:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:10,124 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2018-02-02 10:29:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:10,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 10:29:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:10,125 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:29:10,125 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:29:10,125 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:29:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 10:29:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:29:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2018-02-02 10:29:10,127 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 28 [2018-02-02 10:29:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:10,127 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2018-02-02 10:29:10,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2018-02-02 10:29:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:29:10,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:10,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:10,128 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash 851488222, now seen corresponding path program 1 times [2018-02-02 10:29:10,129 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:10,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:10,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:10,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,226 INFO L182 omatonBuilderFactory]: Interpolants [3739#true, 3740#false, 3741#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|)), 3742#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3743#(and (= (select |#length| |main_#t~mem20.base|) 12) (= |main_#t~mem20.offset| 0))] [2018-02-02 10:29:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:10,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:10,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:10,227 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand 5 states. [2018-02-02 10:29:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:10,416 INFO L93 Difference]: Finished difference Result 229 states and 252 transitions. [2018-02-02 10:29:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:29:10,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:29:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:10,418 INFO L225 Difference]: With dead ends: 229 [2018-02-02 10:29:10,418 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 10:29:10,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:29:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 10:29:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 170. [2018-02-02 10:29:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:29:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2018-02-02 10:29:10,422 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 30 [2018-02-02 10:29:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:10,422 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2018-02-02 10:29:10,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2018-02-02 10:29:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:29:10,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:10,423 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:10,423 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:10,424 INFO L82 PathProgramCache]: Analyzing trace with hash 851488221, now seen corresponding path program 1 times [2018-02-02 10:29:10,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:10,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:10,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:10,484 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:10,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,485 INFO L182 omatonBuilderFactory]: Interpolants [4149#true, 4150#false, 4151#(= 1 (select |#valid| |main_#t~malloc18.base|)), 4152#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4153#(= 1 (select |#valid| |main_#t~mem20.base|))] [2018-02-02 10:29:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:10,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:10,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:10,485 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 5 states. [2018-02-02 10:29:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:10,608 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2018-02-02 10:29:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:10,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:29:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:10,609 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:29:10,609 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:29:10,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:29:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 169. [2018-02-02 10:29:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:29:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2018-02-02 10:29:10,613 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 30 [2018-02-02 10:29:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:10,613 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2018-02-02 10:29:10,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2018-02-02 10:29:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:29:10,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:10,614 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:10,614 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1694170207, now seen corresponding path program 1 times [2018-02-02 10:29:10,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:10,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:10,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:29:10,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,685 INFO L182 omatonBuilderFactory]: Interpolants [4560#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4561#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem20.base|))), 4562#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4563#(= 1 (select |#valid| |main_#t~mem22.base|)), 4555#true, 4556#false, 4557#(= 1 (select |#valid| main_~head~0.base)), 4558#(= (select |#valid| main_~x~0.base) 1), 4559#(and (= 1 (select |#valid| |main_#t~malloc18.base|)) (not (= main_~x~0.base |main_#t~malloc18.base|)))] [2018-02-02 10:29:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:10,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:29:10,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:29:10,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:10,686 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand 9 states. [2018-02-02 10:29:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:10,943 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-02-02 10:29:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:10,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 10:29:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:10,944 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:29:10,944 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:29:10,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:29:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:29:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-02-02 10:29:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:29:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-02-02 10:29:10,946 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 34 [2018-02-02 10:29:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:10,946 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-02-02 10:29:10,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:29:10,946 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-02-02 10:29:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:29:10,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:10,947 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:10,947 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:10,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1694170208, now seen corresponding path program 1 times [2018-02-02 10:29:10,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:10,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:11,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:29:11,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:11,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:29:11,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:11,072 INFO L182 omatonBuilderFactory]: Interpolants [4912#true, 4913#false, 4914#(= 1 (select |#valid| main_~head~0.base)), 4915#(= (select |#valid| main_~x~0.base) 1), 4916#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (not (= main_~x~0.base |main_#t~malloc18.base|))), 4917#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4918#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~x~0.offset)) main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem20.base|))), 4919#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4920#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 4921#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:11,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:11,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:11,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:11,072 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 10 states. [2018-02-02 10:29:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:11,428 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-02 10:29:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:29:11,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:29:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:11,429 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:29:11,429 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:29:11,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:29:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:29:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-02-02 10:29:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:29:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-02-02 10:29:11,433 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 34 [2018-02-02 10:29:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:11,433 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-02-02 10:29:11,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-02-02 10:29:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:29:11,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:11,434 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] [2018-02-02 10:29:11,434 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -666441260, now seen corresponding path program 1 times [2018-02-02 10:29:11,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:11,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:11,578 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:29:11,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:11,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:29:11,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:11,578 INFO L182 omatonBuilderFactory]: Interpolants [5280#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5281#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5282#(= 1 (select |#valid| |main_#t~mem15.base|)), 5283#(= 1 (select |#valid| main_~x~0.base)), 5271#true, 5272#false, 5273#(= 1 (select |#valid| main_~head~0.base)), 5274#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5275#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 5276#(and (= 1 (select |#valid| (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.base main_~head~0.base)), 5277#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 5278#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 5279#(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)))] [2018-02-02 10:29:11,579 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:29:11,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:29:11,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:29:11,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:29:11,579 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 13 states. [2018-02-02 10:29:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:12,009 INFO L93 Difference]: Finished difference Result 252 states and 274 transitions. [2018-02-02 10:29:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:29:12,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 10:29:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:12,011 INFO L225 Difference]: With dead ends: 252 [2018-02-02 10:29:12,011 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 10:29:12,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:29:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 10:29:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 191. [2018-02-02 10:29:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:29:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-02 10:29:12,019 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 39 [2018-02-02 10:29:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:12,019 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-02 10:29:12,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:29:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-02 10:29:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:29:12,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:12,020 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:12,020 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash -666441259, now seen corresponding path program 1 times [2018-02-02 10:29:12,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:12,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:12,461 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:29:12,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:12,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:12,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:12,463 INFO L182 omatonBuilderFactory]: Interpolants [5760#(and (or (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))) (and (= main_~x~0.offset main_~head~0.offset) (= 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))), 5761#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 main_~x~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))))), 5762#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5763#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (<= 12 (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)))), 5764#(and (or (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 |main_#t~mem12.base|)) (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5765#(or (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short14|)), 5766#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5767#(and (= 0 |main_#t~mem15.offset|) (<= 12 (select |#length| |main_#t~mem15.base|))), 5768#(and (<= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 5749#true, 5750#false, 5751#(= |main_#t~malloc0.offset| 0), 5752#(= main_~head~0.offset 0), 5753#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 5754#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 5755#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5756#(and (not (= main_~x~0.base (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.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)), 5757#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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) (not (= main_~x~0.base |main_#t~mem7.base|))), 5758#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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)), 5759#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:29:12,463 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:29:12,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:12,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:12,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:12,464 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 20 states. [2018-02-02 10:29:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:13,785 INFO L93 Difference]: Finished difference Result 322 states and 352 transitions. [2018-02-02 10:29:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:29:13,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-02-02 10:29:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:13,786 INFO L225 Difference]: With dead ends: 322 [2018-02-02 10:29:13,786 INFO L226 Difference]: Without dead ends: 322 [2018-02-02 10:29:13,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:29:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-02-02 10:29:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 189. [2018-02-02 10:29:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 10:29:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2018-02-02 10:29:13,791 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 39 [2018-02-02 10:29:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:13,791 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2018-02-02 10:29:13,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2018-02-02 10:29:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:29:13,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:13,792 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] [2018-02-02 10:29:13,792 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:13,792 INFO L82 PathProgramCache]: Analyzing trace with hash -451805530, now seen corresponding path program 1 times [2018-02-02 10:29:13,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:13,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:13,923 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:29:13,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:13,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:29:13,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:13,924 INFO L182 omatonBuilderFactory]: Interpolants [6338#true, 6339#false, 6340#(= 1 (select |#valid| main_~head~0.base)), 6341#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6342#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 6343#(and (= 1 (select |#valid| (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.base main_~head~0.base)), 6344#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 6345#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 6346#(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))), 6347#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 6348#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6349#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 10:29:13,924 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:29:13,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:29:13,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:29:13,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:29:13,925 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand 12 states. [2018-02-02 10:29:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:14,325 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-02-02 10:29:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:29:14,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:29:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:14,326 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:29:14,326 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 10:29:14,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:29:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 10:29:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 197. [2018-02-02 10:29:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:29:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 218 transitions. [2018-02-02 10:29:14,329 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 218 transitions. Word has length 40 [2018-02-02 10:29:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:14,329 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 218 transitions. [2018-02-02 10:29:14,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:29:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 218 transitions. [2018-02-02 10:29:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:29:14,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:14,329 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] [2018-02-02 10:29:14,329 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash -451805529, now seen corresponding path program 1 times [2018-02-02 10:29:14,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:14,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:14,501 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:29:14,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:14,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:29:14,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:14,502 INFO L182 omatonBuilderFactory]: Interpolants [6848#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6849#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 6850#(and (= |main_#t~mem25.offset| 0) (= (select |#length| |main_#t~mem25.base|) 12)), 6839#true, 6840#false, 6841#(= 1 (select |#valid| main_~head~0.base)), 6842#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6843#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 6844#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 6845#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 6846#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6847#(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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:29:14,503 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:29:14,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:29:14,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:29:14,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:29:14,503 INFO L87 Difference]: Start difference. First operand 197 states and 218 transitions. Second operand 12 states. [2018-02-02 10:29:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:14,938 INFO L93 Difference]: Finished difference Result 272 states and 298 transitions. [2018-02-02 10:29:14,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:29:14,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:29:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:14,939 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:29:14,939 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 10:29:14,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 10:29:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 197. [2018-02-02 10:29:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:29:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-02-02 10:29:14,942 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 40 [2018-02-02 10:29:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:14,943 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-02-02 10:29:14,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:29:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-02-02 10:29:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:29:14,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:14,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:14,943 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1066831637, now seen corresponding path program 1 times [2018-02-02 10:29:14,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:14,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:14,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:14,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:29:14,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:14,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:29:14,989 INFO L182 omatonBuilderFactory]: Interpolants [7338#true, 7339#false, 7340#(not (= 0 |main_#t~malloc0.base|)), 7341#(not (= 0 main_~head~0.base)), 7342#(not (= 0 main_~x~0.base))] [2018-02-02 10:29:14,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:29:14,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:14,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:14,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:14,989 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 5 states. [2018-02-02 10:29:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:15,084 INFO L93 Difference]: Finished difference Result 234 states and 256 transitions. [2018-02-02 10:29:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:15,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 10:29:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:15,085 INFO L225 Difference]: With dead ends: 234 [2018-02-02 10:29:15,085 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 10:29:15,085 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:29:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 10:29:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 197. [2018-02-02 10:29:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 10:29:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2018-02-02 10:29:15,088 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 42 [2018-02-02 10:29:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:15,089 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2018-02-02 10:29:15,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2018-02-02 10:29:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:29:15,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:15,090 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:15,090 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:15,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1564650456, now seen corresponding path program 1 times [2018-02-02 10:29:15,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:15,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:15,248 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:29:15,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:15,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:29:15,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:15,249 INFO L182 omatonBuilderFactory]: Interpolants [7778#true, 7779#false, 7780#(= 1 (select |#valid| main_~head~0.base)), 7781#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7782#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc18.base|)) (not (= main_~x~0.base |main_#t~malloc18.base|)) (= main_~x~0.base main_~head~0.base)), 7783#(and (= 1 (select |#valid| (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.base main_~head~0.base)), 7784#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem20.base|))), 7785#(and (not (= main_~head~0.base |main_#t~mem22.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 7786#(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))), 7787#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7788#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7789#(= 1 (select |#valid| |main_#t~mem27.base|)), 7790#(= 1 (select |#valid| main_~next~0.base)), 7791#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:15,249 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:29:15,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:29:15,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:29:15,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:29:15,250 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand 14 states. [2018-02-02 10:29:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:15,773 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-02-02 10:29:15,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:29:15,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2018-02-02 10:29:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:15,774 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:29:15,774 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:29:15,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:29:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:29:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 235. [2018-02-02 10:29:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 10:29:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 259 transitions. [2018-02-02 10:29:15,777 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 259 transitions. Word has length 46 [2018-02-02 10:29:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:15,777 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 259 transitions. [2018-02-02 10:29:15,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:29:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 259 transitions. [2018-02-02 10:29:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:29:15,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:15,778 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:15,778 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1564650455, now seen corresponding path program 1 times [2018-02-02 10:29:15,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:15,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:15,995 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:29:15,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:15,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:29:15,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:15,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:29:15,996 INFO L182 omatonBuilderFactory]: Interpolants [8352#(and (not (= main_~head~0.base |main_#t~mem22.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8353#(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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 8354#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8355#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8356#(and (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem27.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8357#(and (= 12 (select |#length| main_~next~0.base)) (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8358#(and (= 12 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)), 8359#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 8345#true, 8346#false, 8347#(= 1 (select |#valid| main_~head~0.base)), 8348#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8349#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc18.base|)) (= main_~x~0.base main_~head~0.base)), 8350#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 8351#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~x~0.offset)) main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem20.base|)))] [2018-02-02 10:29:15,996 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:29:15,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:29:15,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:29:15,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:29:15,997 INFO L87 Difference]: Start difference. First operand 235 states and 259 transitions. Second operand 15 states. [2018-02-02 10:29:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:16,579 INFO L93 Difference]: Finished difference Result 292 states and 319 transitions. [2018-02-02 10:29:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:29:16,579 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-02-02 10:29:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:16,580 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:29:16,580 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:29:16,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:29:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:29:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2018-02-02 10:29:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-02 10:29:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-02-02 10:29:16,582 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 46 [2018-02-02 10:29:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:16,583 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-02-02 10:29:16,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:29:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-02-02 10:29:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:29:16,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:16,583 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:16,583 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash 777046974, now seen corresponding path program 1 times [2018-02-02 10:29:16,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:16,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:16,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:29:16,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,637 INFO L182 omatonBuilderFactory]: Interpolants [8912#(= 1 (select |#valid| main_~head~0.base)), 8913#(= 1 (select |#valid| main_~x~0.base)), 8914#(= 1 (select |#valid| main_~prev~0.base)), 8908#true, 8909#false, 8910#(= main_~x~0.base main_~head~0.base), 8911#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:29:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:16,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:16,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:16,638 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 7 states. [2018-02-02 10:29:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:16,776 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2018-02-02 10:29:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:16,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-02-02 10:29:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:16,777 INFO L225 Difference]: With dead ends: 285 [2018-02-02 10:29:16,777 INFO L226 Difference]: Without dead ends: 285 [2018-02-02 10:29:16,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:29:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-02 10:29:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 239. [2018-02-02 10:29:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 10:29:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 266 transitions. [2018-02-02 10:29:16,781 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 266 transitions. Word has length 49 [2018-02-02 10:29:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:16,781 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 266 transitions. [2018-02-02 10:29:16,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 266 transitions. [2018-02-02 10:29:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:29:16,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:16,781 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:16,782 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 777046975, now seen corresponding path program 1 times [2018-02-02 10:29:16,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:16,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:16,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:29:16,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,925 INFO L182 omatonBuilderFactory]: Interpolants [9456#(and (= 0 main_~prev~0.offset) (<= 12 (select |#length| main_~prev~0.base))), 9457#(and (<= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 9448#true, 9449#false, 9450#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 9451#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 9452#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 9453#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9454#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 9455#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 10:29:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:16,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:16,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:16,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:16,926 INFO L87 Difference]: Start difference. First operand 239 states and 266 transitions. Second operand 10 states. [2018-02-02 10:29:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:17,152 INFO L93 Difference]: Finished difference Result 329 states and 366 transitions. [2018-02-02 10:29:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:17,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-02-02 10:29:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:17,153 INFO L225 Difference]: With dead ends: 329 [2018-02-02 10:29:17,154 INFO L226 Difference]: Without dead ends: 329 [2018-02-02 10:29:17,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:29:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-02 10:29:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 262. [2018-02-02 10:29:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-02 10:29:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2018-02-02 10:29:17,158 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 49 [2018-02-02 10:29:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:17,158 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2018-02-02 10:29:17,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2018-02-02 10:29:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:29:17,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:17,159 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:17,159 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1781099676, now seen corresponding path program 2 times [2018-02-02 10:29:17,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:17,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:17,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:29:17,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,744 INFO L182 omatonBuilderFactory]: Interpolants [10080#(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))), 10081#(and (= |main_#t~mem12.offset| 0) (= 0 |main_#t~mem12.base|)), 10082#(not |main_#t~short14|), 10061#true, 10062#false, 10063#(= |main_#t~malloc0.offset| 0), 10064#(= main_~head~0.offset 0), 10065#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 10066#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 10067#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10068#(and (not (= main_~x~0.base (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.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))), 10069#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 10070#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10071#(and (= 0 |main_#t~mem9.offset|) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10072#(and (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))) (or (and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 10073#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 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 (= 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))))), 10074#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 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))), 10075#(and (or (and (= 0 (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| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 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))), 10076#(and (= |main_#t~mem12.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem12.offset|) (= 0 (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| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 |main_#t~mem12.base|))), 10077#(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))) (= 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)))) (not |main_#t~short14|)), 10078#(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)))), 10079#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))] [2018-02-02 10:29:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:29:17,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:29:17,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:29:17,745 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand 22 states. [2018-02-02 10:29:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:19,042 INFO L93 Difference]: Finished difference Result 305 states and 335 transitions. [2018-02-02 10:29:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:29:19,043 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-02-02 10:29:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:19,043 INFO L225 Difference]: With dead ends: 305 [2018-02-02 10:29:19,043 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 10:29:19,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=453, Invalid=1803, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:29:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 10:29:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2018-02-02 10:29:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 10:29:19,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 285 transitions. [2018-02-02 10:29:19,046 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 285 transitions. Word has length 49 [2018-02-02 10:29:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:19,046 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 285 transitions. [2018-02-02 10:29:19,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:29:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 285 transitions. [2018-02-02 10:29:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:29:19,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:19,047 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] [2018-02-02 10:29:19,047 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash -158844349, now seen corresponding path program 3 times [2018-02-02 10:29:19,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:19,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:19,368 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:29:19,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:19,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:19,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,369 INFO L182 omatonBuilderFactory]: Interpolants [10695#true, 10696#false, 10697#(= 1 (select |#valid| main_~head~0.base)), 10698#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10699#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 10700#(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)), 10701#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 10702#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 10703#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 10704#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 10705#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 10706#(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))) (= (select |#valid| main_~x~0.base) 1)), 10707#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 10708#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 10709#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 10710#(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))), 10711#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10712#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10713#(= 1 (select |#valid| |main_#t~mem15.base|)), 10714#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:19,369 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:29:19,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:19,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:19,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:19,370 INFO L87 Difference]: Start difference. First operand 255 states and 285 transitions. Second operand 20 states. [2018-02-02 10:29:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:20,382 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2018-02-02 10:29:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:29:20,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-02 10:29:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:20,383 INFO L225 Difference]: With dead ends: 347 [2018-02-02 10:29:20,383 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:29:20,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=1179, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:29:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:29:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 280. [2018-02-02 10:29:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-02-02 10:29:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2018-02-02 10:29:20,387 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 51 [2018-02-02 10:29:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:20,388 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2018-02-02 10:29:20,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2018-02-02 10:29:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:29:20,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:20,389 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] [2018-02-02 10:29:20,389 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash -158844348, now seen corresponding path program 2 times [2018-02-02 10:29:20,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:20,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:20,755 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:29:20,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:20,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:20,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,755 INFO L182 omatonBuilderFactory]: Interpolants [11392#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 11393#(and (<= 4 (select |#length| main_~x~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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11394#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 11395#(and (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 11396#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 11397#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11398#(and (<= 4 (select |#length| |main_#t~mem15.base|)) (= 0 |main_#t~mem15.offset|)), 11399#(and (<= 4 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 11380#true, 11381#false, 11382#(= 1 (select |#valid| main_~head~0.base)), 11383#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11384#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 11385#(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)), 11386#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 11387#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11388#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 11389#(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)) (<= 0 main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 11390#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (<= 0 main_~x~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 11391#(and (<= 4 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:29:20,756 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:29:20,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:20,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:20,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:20,756 INFO L87 Difference]: Start difference. First operand 280 states and 314 transitions. Second operand 20 states. [2018-02-02 10:29:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:21,723 INFO L93 Difference]: Finished difference Result 376 states and 417 transitions. [2018-02-02 10:29:21,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:29:21,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-02 10:29:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:21,724 INFO L225 Difference]: With dead ends: 376 [2018-02-02 10:29:21,725 INFO L226 Difference]: Without dead ends: 376 [2018-02-02 10:29:21,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:29:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-02-02 10:29:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 294. [2018-02-02 10:29:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:29:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 332 transitions. [2018-02-02 10:29:21,729 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 332 transitions. Word has length 51 [2018-02-02 10:29:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:21,729 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 332 transitions. [2018-02-02 10:29:21,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 332 transitions. [2018-02-02 10:29:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:29:21,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:21,730 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:21,730 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -867348638, now seen corresponding path program 1 times [2018-02-02 10:29:21,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:21,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:21,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:21,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:29:21,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:21,779 INFO L182 omatonBuilderFactory]: Interpolants [12104#true, 12105#false, 12106#(not (= 0 |main_#t~malloc0.base|)), 12107#(not (= 0 main_~head~0.base)), 12108#(not (= 0 main_~x~0.base)), 12109#(not (= 0 main_~prev~0.base))] [2018-02-02 10:29:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:21,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:21,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:21,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:21,779 INFO L87 Difference]: Start difference. First operand 294 states and 332 transitions. Second operand 6 states. [2018-02-02 10:29:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:21,887 INFO L93 Difference]: Finished difference Result 369 states and 408 transitions. [2018-02-02 10:29:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:29:21,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-02-02 10:29:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:21,889 INFO L225 Difference]: With dead ends: 369 [2018-02-02 10:29:21,889 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 10:29:21,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:29:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 10:29:21,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 315. [2018-02-02 10:29:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:29:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 365 transitions. [2018-02-02 10:29:21,893 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 365 transitions. Word has length 52 [2018-02-02 10:29:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:21,894 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 365 transitions. [2018-02-02 10:29:21,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 365 transitions. [2018-02-02 10:29:21,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:29:21,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:21,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] [2018-02-02 10:29:21,894 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:21,895 INFO L82 PathProgramCache]: Analyzing trace with hash 962215684, now seen corresponding path program 1 times [2018-02-02 10:29:21,895 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:21,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:22,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:22,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:29:22,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:22,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:29:22,095 INFO L182 omatonBuilderFactory]: Interpolants [12804#true, 12805#false, 12806#(= 1 (select |#valid| main_~head~0.base)), 12807#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12808#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 12809#(and (= 1 (select |#valid| (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))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 12810#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 12811#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 12812#(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)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 12813#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 12814#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 12815#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem25.base| main_~head~0.base))), 12816#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 12817#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 12818#(= 1 (select |#valid| |main_#t~mem27.base|)), 12819#(= 1 (select |#valid| main_~next~0.base)), 12820#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:22,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:29:22,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:29:22,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:29:22,095 INFO L87 Difference]: Start difference. First operand 315 states and 365 transitions. Second operand 17 states. [2018-02-02 10:29:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:22,762 INFO L93 Difference]: Finished difference Result 402 states and 459 transitions. [2018-02-02 10:29:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:29:22,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:29:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:22,763 INFO L225 Difference]: With dead ends: 402 [2018-02-02 10:29:22,763 INFO L226 Difference]: Without dead ends: 402 [2018-02-02 10:29:22,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:29:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-02-02 10:29:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 327. [2018-02-02 10:29:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 10:29:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 379 transitions. [2018-02-02 10:29:22,767 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 379 transitions. Word has length 52 [2018-02-02 10:29:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:22,767 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 379 transitions. [2018-02-02 10:29:22,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:29:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 379 transitions. [2018-02-02 10:29:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:29:22,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:22,767 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] [2018-02-02 10:29:22,767 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 962215685, now seen corresponding path program 1 times [2018-02-02 10:29:22,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:22,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:23,055 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:23,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:29:23,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:23,056 INFO L182 omatonBuilderFactory]: Interpolants [13582#true, 13583#false, 13584#(= 1 (select |#valid| main_~head~0.base)), 13585#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 13586#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 13587#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 13588#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 13589#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13590#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 13591#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13592#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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))), 13593#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem25.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13594#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 13595#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13596#(and (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem27.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13597#(and (= 12 (select |#length| main_~next~0.base)) (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13598#(and (= 12 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)), 13599#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-02 10:29:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:23,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:29:23,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:29:23,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:29:23,057 INFO L87 Difference]: Start difference. First operand 327 states and 379 transitions. Second operand 18 states. [2018-02-02 10:29:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:23,896 INFO L93 Difference]: Finished difference Result 409 states and 469 transitions. [2018-02-02 10:29:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:29:23,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-02-02 10:29:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:23,898 INFO L225 Difference]: With dead ends: 409 [2018-02-02 10:29:23,898 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 10:29:23,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:29:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 10:29:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 316. [2018-02-02 10:29:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 10:29:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 366 transitions. [2018-02-02 10:29:23,902 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 366 transitions. Word has length 52 [2018-02-02 10:29:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:23,903 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 366 transitions. [2018-02-02 10:29:23,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:29:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 366 transitions. [2018-02-02 10:29:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:29:23,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:23,904 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] [2018-02-02 10:29:23,904 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1896170473, now seen corresponding path program 2 times [2018-02-02 10:29:23,904 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:23,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:24,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:29:24,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:24,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:29:24,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:24,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:29:24,167 INFO L182 omatonBuilderFactory]: Interpolants [14368#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 14369#(= 1 (select |#valid| |main_#t~mem25.base|)), 14351#true, 14352#false, 14353#(= 1 (select |#valid| main_~head~0.base)), 14354#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 14355#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 14356#(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)), 14357#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 14358#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 14359#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 14360#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 14361#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))), 14362#(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))) (= (select |#valid| main_~x~0.base) 1)), 14363#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 14364#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 14365#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 14366#(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))), 14367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-02-02 10:29:24,167 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:29:24,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:29:24,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:29:24,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:29:24,167 INFO L87 Difference]: Start difference. First operand 316 states and 366 transitions. Second operand 19 states. [2018-02-02 10:29:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:24,927 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-02 10:29:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:29:24,927 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-02-02 10:29:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:24,928 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:29:24,928 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:29:24,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:29:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:29:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 324. [2018-02-02 10:29:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 10:29:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 376 transitions. [2018-02-02 10:29:24,931 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 376 transitions. Word has length 52 [2018-02-02 10:29:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:24,931 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 376 transitions. [2018-02-02 10:29:24,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:29:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 376 transitions. [2018-02-02 10:29:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:29:24,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:24,932 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] [2018-02-02 10:29:24,932 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1896170472, now seen corresponding path program 2 times [2018-02-02 10:29:24,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:24,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:25,228 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:29:25,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:25,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:25,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:25,229 INFO L182 omatonBuilderFactory]: Interpolants [15112#true, 15113#false, 15114#(= 1 (select |#valid| main_~head~0.base)), 15115#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15116#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 15117#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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)), 15118#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 15119#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15120#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 15121#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15122#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)), 15123#(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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)), 15124#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#length| main_~x~0.base) 12)), 15125#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~x~0.base) 12)), 15126#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15127#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 15128#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 15129#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 15130#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 15131#(and (= |main_#t~mem25.offset| 0) (<= 12 (select |#length| |main_#t~mem25.base|)))] [2018-02-02 10:29:25,229 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:29:25,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:25,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:25,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:25,230 INFO L87 Difference]: Start difference. First operand 324 states and 376 transitions. Second operand 20 states. [2018-02-02 10:29:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:26,143 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-02 10:29:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:29:26,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 10:29:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:26,144 INFO L225 Difference]: With dead ends: 382 [2018-02-02 10:29:26,144 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 10:29:26,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:29:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 10:29:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 324. [2018-02-02 10:29:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 10:29:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 375 transitions. [2018-02-02 10:29:26,148 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 375 transitions. Word has length 52 [2018-02-02 10:29:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:26,148 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 375 transitions. [2018-02-02 10:29:26,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 375 transitions. [2018-02-02 10:29:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:29:26,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:26,149 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:26,149 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -79227823, now seen corresponding path program 2 times [2018-02-02 10:29:26,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:26,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:26,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:29:26,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,485 INFO L182 omatonBuilderFactory]: Interpolants [15872#(= 1 (select |#valid| main_~head~0.base)), 15873#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 15874#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc18.base|)) (= main_~x~0.base main_~head~0.base)), 15875#(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)), 15876#(and (= |main_#t~mem20.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) (not (= main_~x~0.base |main_#t~mem20.base|))), 15877#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.offset|) (not (= main_~head~0.base |main_#t~mem22.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem22.base|)), 15878#(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))), 15879#(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))), 15880#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 15881#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15882#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem27.base|) |main_#t~mem27.offset|)) (not (= main_~x~0.base |main_#t~mem27.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_~prev~0.offset)) |main_#t~mem27.base|) |main_#t~mem27.offset|))), 15883#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset)) (not (= main_~x~0.base main_~next~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_~prev~0.offset)) main_~next~0.base) main_~next~0.offset))), 15884#(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 4) main_~next~0.offset)) main_~next~0.base) main_~next~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 4) main_~next~0.base)) main_~next~0.base) main_~next~0.offset))), 15885#(and (= 0 (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~next~0.base) main_~next~0.offset))), 15886#(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))), 15887#(and (= 0 |main_#t~mem27.offset|) (= 0 |main_#t~mem27.base|)), 15888#(and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 15889#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 15870#true, 15871#false] [2018-02-02 10:29:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:26,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:26,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:26,486 INFO L87 Difference]: Start difference. First operand 324 states and 375 transitions. Second operand 20 states. [2018-02-02 10:29:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:27,445 INFO L93 Difference]: Finished difference Result 457 states and 526 transitions. [2018-02-02 10:29:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:29:27,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 10:29:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:27,446 INFO L225 Difference]: With dead ends: 457 [2018-02-02 10:29:27,446 INFO L226 Difference]: Without dead ends: 457 [2018-02-02 10:29:27,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:29:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-02-02 10:29:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 341. [2018-02-02 10:29:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-02-02 10:29:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 393 transitions. [2018-02-02 10:29:27,456 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 393 transitions. Word has length 53 [2018-02-02 10:29:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:27,456 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 393 transitions. [2018-02-02 10:29:27,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 393 transitions. [2018-02-02 10:29:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:29:27,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:27,457 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:27,457 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1112311740, now seen corresponding path program 1 times [2018-02-02 10:29:27,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:27,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:27,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:27,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:27,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:27,743 INFO L182 omatonBuilderFactory]: Interpolants [16736#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| 0))), 16737#(or (and (not (= main_~head~0.base |main_#t~mem22.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| 0))), 16738#(or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (= 1 (select |#valid| 0))), 16739#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 16740#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0)))), 16741#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (not (= 0 |main_#t~mem27.base|))), 16742#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (not (= 0 main_~next~0.base))), 16743#(or (not (= 0 main_~next~0.base)) (and (= 1 (select |#valid| 0)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset)))), 16744#(or (not (= 0 main_~x~0.base)) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)))), 16745#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 16746#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16747#(= 1 (select |#valid| |main_#t~mem31.base|)), 16728#true, 16729#false, 16730#(= (select |#valid| 0) 0), 16731#(and (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| 0) 0)), 16732#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| 0) 0) (= main_~x~0.base main_~head~0.base)), 16733#(and (not (= 0 |main_#t~malloc18.base|)) (or (= 1 (select |#valid| 0)) (not (= main_~x~0.base |main_#t~malloc18.base|))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 16734#(and (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 16735#(and (or (= 1 (select |#valid| 0)) (not (= main_~x~0.base |main_#t~mem20.base|))) (or (and (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)) (= main_~x~0.base |main_#t~mem20.base|)))] [2018-02-02 10:29:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:27,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:27,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:27,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:27,743 INFO L87 Difference]: Start difference. First operand 341 states and 393 transitions. Second operand 20 states. [2018-02-02 10:29:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:28,392 INFO L93 Difference]: Finished difference Result 353 states and 403 transitions. [2018-02-02 10:29:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:29:28,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 10:29:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:28,393 INFO L225 Difference]: With dead ends: 353 [2018-02-02 10:29:28,393 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 10:29:28,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:29:28,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 10:29:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 341. [2018-02-02 10:29:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-02-02 10:29:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 392 transitions. [2018-02-02 10:29:28,396 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 392 transitions. Word has length 53 [2018-02-02 10:29:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:28,397 INFO L432 AbstractCegarLoop]: Abstraction has 341 states and 392 transitions. [2018-02-02 10:29:28,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 392 transitions. [2018-02-02 10:29:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:29:28,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:28,397 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:28,397 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1954655990, now seen corresponding path program 2 times [2018-02-02 10:29:28,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:28,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:28,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:28,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:29:28,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:28,631 INFO L182 omatonBuilderFactory]: Interpolants [17472#(= 1 (select |#valid| main_~head~0.base)), 17473#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 17474#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc18.base|)) (= main_~x~0.base main_~head~0.base)), 17475#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 17476#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~x~0.offset)) main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem20.base|))), 17477#(and (not (= main_~head~0.base |main_#t~mem22.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17478#(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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 17479#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 17480#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17481#(and (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem27.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17482#(and (= 12 (select |#length| main_~next~0.base)) (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 17483#(and (= 12 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)), 17484#(and (= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 17485#(and (= 12 (select |#length| main_~prev~0.base)) (<= 0 main_~prev~0.offset) (<= main_~prev~0.offset 0)), 17470#true, 17471#false] [2018-02-02 10:29:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:28,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:29:28,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:29:28,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:29:28,632 INFO L87 Difference]: Start difference. First operand 341 states and 392 transitions. Second operand 16 states. [2018-02-02 10:29:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:29,384 INFO L93 Difference]: Finished difference Result 415 states and 475 transitions. [2018-02-02 10:29:29,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:29:29,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 10:29:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:29,385 INFO L225 Difference]: With dead ends: 415 [2018-02-02 10:29:29,386 INFO L226 Difference]: Without dead ends: 415 [2018-02-02 10:29:29,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:29:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-02-02 10:29:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 357. [2018-02-02 10:29:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 10:29:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 413 transitions. [2018-02-02 10:29:29,391 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 413 transitions. Word has length 56 [2018-02-02 10:29:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:29,391 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 413 transitions. [2018-02-02 10:29:29,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:29:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 413 transitions. [2018-02-02 10:29:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:29:29,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:29,392 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] [2018-02-02 10:29:29,392 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:29,392 INFO L82 PathProgramCache]: Analyzing trace with hash -411327031, now seen corresponding path program 1 times [2018-02-02 10:29:29,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:29,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:29,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:29,794 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,795 INFO L182 omatonBuilderFactory]: Interpolants [18284#true, 18285#false, 18286#(= 1 (select |#valid| main_~head~0.base)), 18287#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 18288#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 18289#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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)), 18290#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 18291#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18292#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 18293#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18294#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 18295#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18296#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 18297#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18298#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18299#(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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 18300#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18301#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18302#(and (= 12 (select |#length| |main_#t~mem15.base|)) (= 0 |main_#t~mem15.offset|)), 18303#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:29,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:29,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:29,795 INFO L87 Difference]: Start difference. First operand 357 states and 413 transitions. Second operand 20 states. [2018-02-02 10:29:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:30,691 INFO L93 Difference]: Finished difference Result 420 states and 477 transitions. [2018-02-02 10:29:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:29:30,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 10:29:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:30,692 INFO L225 Difference]: With dead ends: 420 [2018-02-02 10:29:30,692 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 10:29:30,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:29:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 10:29:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 352. [2018-02-02 10:29:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:29:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 406 transitions. [2018-02-02 10:29:30,696 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 406 transitions. Word has length 58 [2018-02-02 10:29:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:30,696 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 406 transitions. [2018-02-02 10:29:30,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 406 transitions. [2018-02-02 10:29:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:29:30,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:30,697 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:30,697 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash -10056501, now seen corresponding path program 2 times [2018-02-02 10:29:30,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:30,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:29:30,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:30,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:30,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:30,727 INFO L182 omatonBuilderFactory]: Interpolants [19106#true, 19107#false, 19108#(or (not (= 0 main_~x~0.offset)) (not (= 0 main_~x~0.base))), 19109#(or (not (= 0 main_~prev~0.offset)) (not (= 0 main_~prev~0.base)))] [2018-02-02 10:29:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:29:30,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:30,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:30,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:30,727 INFO L87 Difference]: Start difference. First operand 352 states and 406 transitions. Second operand 4 states. [2018-02-02 10:29:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:30,783 INFO L93 Difference]: Finished difference Result 356 states and 407 transitions. [2018-02-02 10:29:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:30,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-02-02 10:29:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:30,784 INFO L225 Difference]: With dead ends: 356 [2018-02-02 10:29:30,784 INFO L226 Difference]: Without dead ends: 356 [2018-02-02 10:29:30,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-02 10:29:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2018-02-02 10:29:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:29:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 404 transitions. [2018-02-02 10:29:30,787 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 404 transitions. Word has length 59 [2018-02-02 10:29:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:30,787 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 404 transitions. [2018-02-02 10:29:30,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 404 transitions. [2018-02-02 10:29:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:29:30,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:30,787 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:30,787 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 363952629, now seen corresponding path program 2 times [2018-02-02 10:29:30,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:30,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:31,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:31,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:29:31,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:31,265 INFO L182 omatonBuilderFactory]: Interpolants [19840#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (<= (+ main_~x~0.offset 8) 0)), 19841#(and (= 0 |main_#t~mem27.offset|) (= 0 |main_#t~mem27.base|)), 19842#(and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 19843#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 19821#true, 19822#false, 19823#(= 1 (select |#valid| main_~head~0.base)), 19824#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 19825#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 19826#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 19827#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 19828#(and (= 0 |main_#t~mem9.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 19829#(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_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 main_~x~0.offset)), 19830#(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_~x~0.offset)), 19831#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 19832#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 19833#(and (or (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (+ |main_#t~mem25.offset| 8) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (= |main_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (+ |main_#t~mem25.offset| 8) 0))) (not (= |main_#t~mem25.base| main_~head~0.base))), 19834#(or (<= (+ (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 8) 0) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 19835#(or (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) 0) (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~prev~0.offset)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 19836#(or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) |main_#t~mem27.base|) |main_#t~mem27.offset|)) (not (= main_~x~0.base |main_#t~mem27.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_~prev~0.offset)) |main_#t~mem27.base|) |main_#t~mem27.offset|))) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) 0) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 19837#(or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~prev~0.base)) main_~next~0.base) main_~next~0.offset)) (not (= main_~x~0.base main_~next~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_~prev~0.offset)) main_~next~0.base) main_~next~0.offset))) (and (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8) 0) (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 19838#(or (<= (+ main_~next~0.offset 8) 0) (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 4) main_~next~0.offset)) main_~next~0.base) main_~next~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 4) main_~next~0.base)) main_~next~0.base) main_~next~0.offset)))), 19839#(or (<= (+ main_~next~0.offset 8) 0) (and (= 0 (select (select |#memory_$Pointer$.base| main_~next~0.base) main_~next~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~next~0.base) main_~next~0.offset))))] [2018-02-02 10:29:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:31,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:29:31,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:29:31,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:29:31,266 INFO L87 Difference]: Start difference. First operand 352 states and 404 transitions. Second operand 23 states. [2018-02-02 10:29:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:32,593 INFO L93 Difference]: Finished difference Result 485 states and 553 transitions. [2018-02-02 10:29:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:29:32,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-02-02 10:29:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:32,595 INFO L225 Difference]: With dead ends: 485 [2018-02-02 10:29:32,595 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 10:29:32,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:29:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 10:29:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 355. [2018-02-02 10:29:32,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 10:29:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 407 transitions. [2018-02-02 10:29:32,598 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 407 transitions. Word has length 59 [2018-02-02 10:29:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:32,598 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 407 transitions. [2018-02-02 10:29:32,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:29:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 407 transitions. [2018-02-02 10:29:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:29:32,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:32,599 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:32,599 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash -669131288, now seen corresponding path program 1 times [2018-02-02 10:29:32,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:32,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:33,035 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:29:33,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:33,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:29:33,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:33,036 INFO L182 omatonBuilderFactory]: Interpolants [20736#(or (and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| 0))), 20737#(or (= 1 (select |#valid| 0)) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 20738#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (= 1 (select |#valid| 0))), 20739#(or (= 1 (select |#valid| 0)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 20740#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem25.base| main_~head~0.base))) (= 1 (select |#valid| 0))), 20741#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| 0))), 20742#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0)))), 20743#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (not (= 0 |main_#t~mem27.base|))), 20744#(or (and (= 0 main_~prev~0.base) (= 1 (select |#valid| 0))) (not (= 0 main_~next~0.base))), 20745#(or (not (= 0 main_~next~0.base)) (and (= 1 (select |#valid| 0)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset)))), 20746#(or (not (= 0 main_~x~0.base)) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset)))), 20747#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 20748#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 20749#(= 1 (select |#valid| |main_#t~mem31.base|)), 20728#true, 20729#false, 20730#(= (select |#valid| 0) 0), 20731#(and (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| 0) 0)), 20732#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| 0) 0) (= main_~x~0.base main_~head~0.base)), 20733#(or (and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (not (= 0 |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| 0))), 20734#(or (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)) (= 1 (select |#valid| 0))), 20735#(or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))) (= 1 (select |#valid| 0)))] [2018-02-02 10:29:33,036 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:29:33,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:29:33,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:29:33,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:29:33,037 INFO L87 Difference]: Start difference. First operand 355 states and 407 transitions. Second operand 22 states. [2018-02-02 10:29:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:33,902 INFO L93 Difference]: Finished difference Result 381 states and 431 transitions. [2018-02-02 10:29:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:29:33,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-02-02 10:29:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:33,903 INFO L225 Difference]: With dead ends: 381 [2018-02-02 10:29:33,903 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 10:29:33,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:29:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 10:29:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 355. [2018-02-02 10:29:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-02-02 10:29:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 406 transitions. [2018-02-02 10:29:33,906 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 406 transitions. Word has length 59 [2018-02-02 10:29:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:33,906 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 406 transitions. [2018-02-02 10:29:33,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:29:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2018-02-02 10:29:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:29:33,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:33,907 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:33,907 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash -306059269, now seen corresponding path program 2 times [2018-02-02 10:29:33,908 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:33,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:33,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:33,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:29:33,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:33,970 INFO L182 omatonBuilderFactory]: Interpolants [21520#true, 21521#false, 21522#(= main_~x~0.base main_~head~0.base), 21523#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 21524#(= 1 (select |#valid| main_~head~0.base)), 21525#(= 1 (select |#valid| main_~x~0.base)), 21526#(= 1 (select |#valid| main_~prev~0.base)), 21527#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset))), 21528#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 21529#(= 1 (select |#valid| |main_#t~mem31.base|))] [2018-02-02 10:29:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:33,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:33,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:33,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:33,970 INFO L87 Difference]: Start difference. First operand 355 states and 406 transitions. Second operand 10 states. [2018-02-02 10:29:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:34,271 INFO L93 Difference]: Finished difference Result 421 states and 457 transitions. [2018-02-02 10:29:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:29:34,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-02-02 10:29:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:34,273 INFO L225 Difference]: With dead ends: 421 [2018-02-02 10:29:34,273 INFO L226 Difference]: Without dead ends: 421 [2018-02-02 10:29:34,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:29:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-02-02 10:29:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 359. [2018-02-02 10:29:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-02 10:29:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 412 transitions. [2018-02-02 10:29:34,277 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 412 transitions. Word has length 60 [2018-02-02 10:29:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:34,277 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 412 transitions. [2018-02-02 10:29:34,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 412 transitions. [2018-02-02 10:29:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:29:34,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:34,278 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:34,278 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -306059268, now seen corresponding path program 1 times [2018-02-02 10:29:34,279 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:34,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:34,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:34,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:29:34,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:34,470 INFO L182 omatonBuilderFactory]: Interpolants [22339#true, 22340#false, 22341#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 22342#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 22343#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 22344#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 22345#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 22346#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 22347#(and (= 0 main_~prev~0.offset) (<= 12 (select |#length| main_~prev~0.base))), 22348#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.offset) main_~x~0.offset)) (<= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset)))), 22349#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset))), 22350#(and (<= 12 (select |#length| |main_#t~mem31.base|)) (= |main_#t~mem31.offset| 0))] [2018-02-02 10:29:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:34,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:29:34,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:29:34,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:29:34,471 INFO L87 Difference]: Start difference. First operand 359 states and 412 transitions. Second operand 12 states. [2018-02-02 10:29:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:34,957 INFO L93 Difference]: Finished difference Result 473 states and 526 transitions. [2018-02-02 10:29:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:29:34,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-02-02 10:29:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:34,959 INFO L225 Difference]: With dead ends: 473 [2018-02-02 10:29:34,959 INFO L226 Difference]: Without dead ends: 473 [2018-02-02 10:29:34,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:29:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-02-02 10:29:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 374. [2018-02-02 10:29:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-02-02 10:29:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2018-02-02 10:29:34,964 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 60 [2018-02-02 10:29:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:34,965 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2018-02-02 10:29:34,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:29:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2018-02-02 10:29:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:29:34,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:34,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:34,966 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1646435053, now seen corresponding path program 4 times [2018-02-02 10:29:34,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:34,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:35,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:29:35,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,292 INFO L182 omatonBuilderFactory]: Interpolants [23232#(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))) (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))), 23233#(and (= 1 (select |#valid| (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))), 23234#(and (= 1 (select |#valid| (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))), 23235#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) 0))) (= 0 |main_#t~mem15.offset|)), 23236#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0)), 23237#(= 1 (select |#valid| |main_#t~mem15.base|)), 23238#(= 1 (select |#valid| main_~x~0.base)), 23218#true, 23219#false, 23220#(= 1 (select |#valid| main_~head~0.base)), 23221#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 23222#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 23223#(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)), 23224#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 23225#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23226#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~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))), 23227#(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)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23228#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 23229#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (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))), 23230#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) 0)))), 23231#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (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)))] [2018-02-02 10:29:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:29:35,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:29:35,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:35,293 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand 21 states. [2018-02-02 10:29:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:36,222 INFO L93 Difference]: Finished difference Result 443 states and 505 transitions. [2018-02-02 10:29:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:29:36,222 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 10:29:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:36,223 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:29:36,223 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 10:29:36,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:29:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 10:29:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 381. [2018-02-02 10:29:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-02-02 10:29:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 442 transitions. [2018-02-02 10:29:36,226 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 442 transitions. Word has length 61 [2018-02-02 10:29:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:36,226 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 442 transitions. [2018-02-02 10:29:36,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:29:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 442 transitions. [2018-02-02 10:29:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:29:36,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:36,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:36,226 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1646435052, now seen corresponding path program 3 times [2018-02-02 10:29:36,227 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:36,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:36,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:36,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:29:36,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:36,641 INFO L182 omatonBuilderFactory]: Interpolants [24101#true, 24102#false, 24103#(= 1 (select |#valid| main_~head~0.base)), 24104#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 24105#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 24106#(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)), 24107#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 24108#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24109#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~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))), 24110#(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)) (= main_~x~0.offset 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24111#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 12 (select |#length| |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 24112#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) 0))) (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)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 24113#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) 0))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 24114#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (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))), 24115#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 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))), 24116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 12 (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))), 24117#(and (= 12 (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| (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))), 24118#(and (= 0 |main_#t~mem15.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) 0)))), 24119#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 24120#(and (= 12 (select |#length| |main_#t~mem15.base|)) (= 0 |main_#t~mem15.offset|)), 24121#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:36,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:29:36,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:29:36,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:36,641 INFO L87 Difference]: Start difference. First operand 381 states and 442 transitions. Second operand 21 states. [2018-02-02 10:29:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:37,911 INFO L93 Difference]: Finished difference Result 475 states and 541 transitions. [2018-02-02 10:29:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:29:37,911 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 10:29:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:37,912 INFO L225 Difference]: With dead ends: 475 [2018-02-02 10:29:37,912 INFO L226 Difference]: Without dead ends: 475 [2018-02-02 10:29:37,912 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:29:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-02-02 10:29:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 384. [2018-02-02 10:29:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-02-02 10:29:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 446 transitions. [2018-02-02 10:29:37,915 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 446 transitions. Word has length 61 [2018-02-02 10:29:37,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:37,915 INFO L432 AbstractCegarLoop]: Abstraction has 384 states and 446 transitions. [2018-02-02 10:29:37,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:29:37,915 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 446 transitions. [2018-02-02 10:29:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:29:37,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:37,916 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:37,916 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2014033618, now seen corresponding path program 1 times [2018-02-02 10:29:37,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:37,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:38,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:29:38,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,229 INFO L182 omatonBuilderFactory]: Interpolants [25024#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25025#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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))), 25026#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= |main_#t~mem25.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25027#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25028#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25029#(and (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| |main_#t~mem27.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25030#(and (= 12 (select |#length| main_~next~0.base)) (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25031#(and (= 12 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)), 25032#(and (= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 25033#(and (= 12 (select |#length| main_~prev~0.base)) (<= 0 main_~prev~0.offset) (<= main_~prev~0.offset 0)), 25015#true, 25016#false, 25017#(= 1 (select |#valid| main_~head~0.base)), 25018#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 25019#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 25020#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base)), 25021#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 25022#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25023#(and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))] [2018-02-02 10:29:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:29:38,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:29:38,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:29:38,230 INFO L87 Difference]: Start difference. First operand 384 states and 446 transitions. Second operand 19 states. [2018-02-02 10:29:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:39,007 INFO L93 Difference]: Finished difference Result 469 states and 539 transitions. [2018-02-02 10:29:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:29:39,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-02-02 10:29:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:39,008 INFO L225 Difference]: With dead ends: 469 [2018-02-02 10:29:39,008 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 10:29:39,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:29:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 10:29:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 367. [2018-02-02 10:29:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-02 10:29:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 429 transitions. [2018-02-02 10:29:39,011 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 429 transitions. Word has length 62 [2018-02-02 10:29:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:39,012 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 429 transitions. [2018-02-02 10:29:39,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:29:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 429 transitions. [2018-02-02 10:29:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:29:39,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:39,012 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] [2018-02-02 10:29:39,012 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash -766842041, now seen corresponding path program 1 times [2018-02-02 10:29:39,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:39,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:29:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:39,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:39,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:39,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:39,339 INFO L182 omatonBuilderFactory]: Interpolants [25900#true, 25901#false, 25902#(= 1 (select |#valid| main_~head~0.base)), 25903#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 25904#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 25905#(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)), 25906#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 25907#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1)), 25908#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 25909#(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)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 25910#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 25911#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25912#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 25913#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.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))))), 25914#(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))), 25915#(= 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)))), 25916#(= 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)))), 25917#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|))), 25918#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 25919#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 10:29:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:39,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:39,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:39,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:39,340 INFO L87 Difference]: Start difference. First operand 367 states and 429 transitions. Second operand 20 states. [2018-02-02 10:29:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:40,274 INFO L93 Difference]: Finished difference Result 443 states and 509 transitions. [2018-02-02 10:29:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:29:40,275 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-02-02 10:29:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:40,275 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:29:40,276 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 10:29:40,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=1278, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:29:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 10:29:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 375. [2018-02-02 10:29:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-02-02 10:29:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 439 transitions. [2018-02-02 10:29:40,278 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 439 transitions. Word has length 62 [2018-02-02 10:29:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:40,279 INFO L432 AbstractCegarLoop]: Abstraction has 375 states and 439 transitions. [2018-02-02 10:29:40,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 439 transitions. [2018-02-02 10:29:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:29:40,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:40,279 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] [2018-02-02 10:29:40,279 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash -766842040, now seen corresponding path program 1 times [2018-02-02 10:29:40,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:40,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:40,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:40,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,590 INFO L182 omatonBuilderFactory]: Interpolants [26784#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 26785#(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)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 26786#(and (= 0 |main_#t~malloc5.offset|) (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| |main_#t~malloc5.base|))), 26787#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 26788#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 26789#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 26790#(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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 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))))), 26791#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 26792#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))), 26793#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) |main_#t~mem15.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) |main_#t~mem15.offset|)))), 26794#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26795#(and (= |main_#t~mem25.offset| 0) (= (select |#length| |main_#t~mem25.base|) 12)), 26776#true, 26777#false, 26778#(= 1 (select |#valid| main_~head~0.base)), 26779#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 26780#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 26781#(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)), 26782#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 26783#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-02 10:29:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:40,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:40,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:40,591 INFO L87 Difference]: Start difference. First operand 375 states and 439 transitions. Second operand 20 states. [2018-02-02 10:29:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:41,614 INFO L93 Difference]: Finished difference Result 443 states and 509 transitions. [2018-02-02 10:29:41,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:29:41,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-02-02 10:29:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:41,615 INFO L225 Difference]: With dead ends: 443 [2018-02-02 10:29:41,615 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 10:29:41,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:29:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 10:29:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 373. [2018-02-02 10:29:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-02 10:29:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 436 transitions. [2018-02-02 10:29:41,619 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 436 transitions. Word has length 62 [2018-02-02 10:29:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:41,619 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 436 transitions. [2018-02-02 10:29:41,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 436 transitions. [2018-02-02 10:29:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:29:41,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:41,620 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:41,620 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash 404839474, now seen corresponding path program 5 times [2018-02-02 10:29:41,621 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:41,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:42,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:42,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:29:42,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:42,260 INFO L182 omatonBuilderFactory]: Interpolants [27648#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= (select |#length| main_~head~0.base) 12)), 27649#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 27650#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#length| main_~x~0.base) 12)), 27651#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 27652#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 27653#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#length| main_~head~0.base) 12) (= (select |#valid| main_~head~0.base) 1)), 27654#(and (= 0 main_~head~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) 12) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 27655#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| |main_#t~malloc5.base|)) (= (select |#valid| main_~head~0.base) 1) (= (select |#length| main_~head~0.base) (select |#length| |main_#t~malloc5.base|))), 27656#(and (= 0 main_~head~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#length| main_~head~0.base) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 27657#(and (= 0 main_~head~0.offset) (= (select |#length| |main_#t~mem7.base|) 12) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#length| main_~head~0.base) (select |#length| |main_#t~mem7.base|)) (= (select |#valid| main_~head~0.base) 1)), 27658#(and (= 0 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)) (<= (select |#length| main_~head~0.base) 12) (= (select |#valid| main_~head~0.base) 1)), 27659#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (<= (select |#length| main_~head~0.base) 12) (= (select |#valid| main_~head~0.base) 1)), 27660#(or (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| main_~x~0.base) 1))) (= main_~x~0.base main_~head~0.base) (or (<= main_~x~0.offset 0) (<= (select |#length| main_~head~0.base) 12))) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)))), 27661#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))) (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (or (and (<= 0 main_~x~0.offset) (<= (select |#length| main_~head~0.base) 12) (= main_~x~0.base main_~head~0.base)) (= main_~x~0.offset 0)))) (= (select |#valid| main_~x~0.base) 1)), 27662#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base))) (= (select |#valid| main_~x~0.base) 1)), 27663#(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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|))), 27664#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27665#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 27666#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 27667#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 27668#(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))), 27669#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 27670#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 27671#(= 1 (select |#valid| |main_#t~mem15.base|)), 27672#(= 1 (select |#valid| main_~x~0.base)), 27644#true, 27645#false, 27646#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 27647#(and (= 0 main_~head~0.offset) (= (select |#length| main_~head~0.base) 12))] [2018-02-02 10:29:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:42,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:29:42,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:29:42,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:29:42,260 INFO L87 Difference]: Start difference. First operand 373 states and 436 transitions. Second operand 29 states. [2018-02-02 10:29:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:43,975 INFO L93 Difference]: Finished difference Result 409 states and 471 transitions. [2018-02-02 10:29:43,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:29:43,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-02-02 10:29:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:43,976 INFO L225 Difference]: With dead ends: 409 [2018-02-02 10:29:43,976 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 10:29:43,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=749, Invalid=2557, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:29:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 10:29:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 380. [2018-02-02 10:29:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-02 10:29:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 444 transitions. [2018-02-02 10:29:43,979 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 444 transitions. Word has length 63 [2018-02-02 10:29:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:43,979 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 444 transitions. [2018-02-02 10:29:43,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:29:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 444 transitions. [2018-02-02 10:29:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:29:43,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:43,980 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:43,980 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash 404839475, now seen corresponding path program 4 times [2018-02-02 10:29:43,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:43,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:44,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:29:44,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,785 INFO L182 omatonBuilderFactory]: Interpolants [28544#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (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)))), 28545#(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 (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 28546#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (and (= |main_#t~mem12.offset| 0) (= 0 |main_#t~mem12.base|))), 28547#(or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (not |main_#t~short14|)), 28548#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 28549#(and (= 12 (select |#length| |main_#t~mem15.base|)) (= 0 |main_#t~mem15.offset|)), 28550#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 28520#true, 28521#false, 28522#(and (= |main_#t~malloc0.offset| 0) (= 12 (select |#length| |main_#t~malloc0.base|))), 28523#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 28524#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 28525#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 28526#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 28527#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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) (= (select |#length| main_~x~0.base) 12)), 28528#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1) (= (select |#length| main_~x~0.base) 12)), 28529#(and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28530#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 28531#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28532#(and (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 28533#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~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)), 28534#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 28535#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 28536#(and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 28537#(and (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 28538#(and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 28539#(or (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0))), 28540#(or (and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= main_~head~0.offset 0))), 28541#(or (and (= 12 (select |#length| main_~head~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.base |main_#t~mem9.base|) (= main_~head~0.offset 0))), 28542#(or (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12)) (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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 28543#(or (and (<= 0 main_~x~0.offset) (or (not (= main_~x~0.offset 0)) (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)))) (= (select |#length| main_~x~0.base) 12)) (and (= 12 (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))))] [2018-02-02 10:29:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:29:44,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:29:44,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:29:44,785 INFO L87 Difference]: Start difference. First operand 380 states and 444 transitions. Second operand 31 states. [2018-02-02 10:29:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:47,364 INFO L93 Difference]: Finished difference Result 565 states and 644 transitions. [2018-02-02 10:29:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:29:47,365 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 63 [2018-02-02 10:29:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:47,366 INFO L225 Difference]: With dead ends: 565 [2018-02-02 10:29:47,366 INFO L226 Difference]: Without dead ends: 565 [2018-02-02 10:29:47,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1026, Invalid=4086, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 10:29:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-02 10:29:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 398. [2018-02-02 10:29:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-02 10:29:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 465 transitions. [2018-02-02 10:29:47,371 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 465 transitions. Word has length 63 [2018-02-02 10:29:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:47,371 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 465 transitions. [2018-02-02 10:29:47,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:29:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 465 transitions. [2018-02-02 10:29:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:29:47,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:47,371 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:47,371 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:47,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1256545013, now seen corresponding path program 3 times [2018-02-02 10:29:47,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:47,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:47,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:29:47,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,936 INFO L182 omatonBuilderFactory]: Interpolants [29596#true, 29597#false, 29598#(= 0 |main_#t~malloc0.offset|), 29599#(= 0 main_~head~0.offset), 29600#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 29601#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 29602#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 29603#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 29604#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~head~0.offset)))), 29605#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)), 29606#(and (= 0 main_~head~0.offset) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset) 0) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 29607#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset) 0)), 29608#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)), 29609#(and (= 0 main_~head~0.offset) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset) 0) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)))), 29610#(and (= 0 main_~head~0.offset) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) 0)), 29611#(or (and (= 0 main_~head~0.offset) (or (and (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset) 0) (= main_~x~0.base main_~head~0.base)) (<= (+ main_~x~0.offset 8) 0))) (and (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 29612#(or (and (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))) (and (= 0 main_~head~0.offset) (not (= (+ main_~x~0.offset 8) 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))), 29613#(or (and (= 0 main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 29614#(and (= main_~x~0.offset main_~head~0.offset) (or (and (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| 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.base main_~head~0.base)), 29615#(and (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 29616#(and (or (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (<= main_~x~0.offset 0) (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 29617#(or (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem25.base| main_~head~0.base))) (and (not (= (+ |main_#t~mem25.offset| 8) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) main_~head~0.offset))) (= |main_#t~mem25.base| main_~head~0.base))), 29618#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 29619#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 29620#(= 1 (select |#valid| |main_#t~mem27.base|)), 29621#(= 1 (select |#valid| main_~next~0.base)), 29622#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:29:47,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:29:47,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:29:47,937 INFO L87 Difference]: Start difference. First operand 398 states and 465 transitions. Second operand 27 states. [2018-02-02 10:29:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:49,273 INFO L93 Difference]: Finished difference Result 500 states and 573 transitions. [2018-02-02 10:29:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:29:49,274 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 10:29:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:49,275 INFO L225 Difference]: With dead ends: 500 [2018-02-02 10:29:49,275 INFO L226 Difference]: Without dead ends: 500 [2018-02-02 10:29:49,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:29:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-02-02 10:29:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 414. [2018-02-02 10:29:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 10:29:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 485 transitions. [2018-02-02 10:29:49,279 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 485 transitions. Word has length 64 [2018-02-02 10:29:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:49,279 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 485 transitions. [2018-02-02 10:29:49,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:29:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 485 transitions. [2018-02-02 10:29:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:29:49,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:49,280 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:49,280 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1256545014, now seen corresponding path program 2 times [2018-02-02 10:29:49,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:49,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:49,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:49,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:29:49,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:49,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:29:49,886 INFO L182 omatonBuilderFactory]: Interpolants [30597#true, 30598#false, 30599#(= 1 (select |#valid| main_~head~0.base)), 30600#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30601#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 30602#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 30603#(and (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 30604#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30605#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 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))), 30606#(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)) (<= 0 main_~x~0.offset) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30607#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 30608#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (<= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 30609#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30610#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (<= 12 (select |#length| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 30611#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30612#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30613#(and (<= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 30614#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30615#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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))), 30616#(and (<= 12 (select |#length| |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~mem25.base| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30617#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 30618#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30619#(and (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 12 (select |#length| |main_#t~mem27.base|))), 30620#(and (= main_~next~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= 12 (select |#length| main_~next~0.base))), 30621#(and (= 0 main_~next~0.offset) (<= 12 (select |#length| main_~next~0.base))), 30622#(and (<= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 10:29:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:49,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:29:49,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:29:49,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:29:49,886 INFO L87 Difference]: Start difference. First operand 414 states and 485 transitions. Second operand 26 states. [2018-02-02 10:29:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:51,218 INFO L93 Difference]: Finished difference Result 560 states and 644 transitions. [2018-02-02 10:29:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:29:51,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2018-02-02 10:29:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:51,219 INFO L225 Difference]: With dead ends: 560 [2018-02-02 10:29:51,219 INFO L226 Difference]: Without dead ends: 560 [2018-02-02 10:29:51,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1624, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:29:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-02-02 10:29:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 429. [2018-02-02 10:29:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-02-02 10:29:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 501 transitions. [2018-02-02 10:29:51,223 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 501 transitions. Word has length 64 [2018-02-02 10:29:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:51,223 INFO L432 AbstractCegarLoop]: Abstraction has 429 states and 501 transitions. [2018-02-02 10:29:51,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:29:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 501 transitions. [2018-02-02 10:29:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:29:51,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:51,224 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, 1, 1, 1, 1] [2018-02-02 10:29:51,224 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1601841144, now seen corresponding path program 3 times [2018-02-02 10:29:51,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:51,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:51,971 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:29:51,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:51,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:29:51,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:51,971 INFO L182 omatonBuilderFactory]: Interpolants [31648#true, 31649#false, 31650#(and (= |main_#t~malloc0.offset| 0) (= 12 (select |#length| |main_#t~malloc0.base|))), 31651#(and (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)), 31652#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 31653#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 31654#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 31655#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 31656#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 31657#(and (= 12 (select |#length| main_~head~0.base)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0)), 31658#(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)) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 31659#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 31660#(and (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 31661#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 31662#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 31663#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0)), 31664#(and (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 31665#(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))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 31666#(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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base main_~x~0.base)) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~head~0.offset 0)), 31667#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base main_~x~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 31668#(or (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= 12 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0)) (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0))), 31669#(or (and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base) (= main_~head~0.offset 0))), 31670#(or (and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| main_~head~0.base) (= main_~head~0.offset 0)) (and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0))), 31671#(or (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))) (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12)) (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= main_~x~0.offset 0))), 31672#(or (and (<= 0 main_~x~0.offset) (or (not (= main_~x~0.offset 0)) (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)))) (= (select |#length| main_~x~0.base) 12)) (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))) (and (= main_~x~0.offset 0) (or (not (= main_~x~0.offset 0)) (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)))))), 31673#(or (and (= 0 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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 31674#(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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 31675#(or (and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 31676#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 31677#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 10:29:51,971 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:29:51,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:29:51,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:29:51,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:29:51,972 INFO L87 Difference]: Start difference. First operand 429 states and 501 transitions. Second operand 30 states. [2018-02-02 10:29:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:53,944 INFO L93 Difference]: Finished difference Result 553 states and 632 transitions. [2018-02-02 10:29:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:29:53,944 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-02-02 10:29:53,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:53,946 INFO L225 Difference]: With dead ends: 553 [2018-02-02 10:29:53,946 INFO L226 Difference]: Without dead ends: 553 [2018-02-02 10:29:53,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=729, Invalid=3303, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:29:53,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-02-02 10:29:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 437. [2018-02-02 10:29:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-02 10:29:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 511 transitions. [2018-02-02 10:29:53,951 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 511 transitions. Word has length 64 [2018-02-02 10:29:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:53,951 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 511 transitions. [2018-02-02 10:29:53,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:29:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 511 transitions. [2018-02-02 10:29:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:29:53,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:53,952 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, 1, 1, 1, 1] [2018-02-02 10:29:53,952 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:53,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1601841143, now seen corresponding path program 3 times [2018-02-02 10:29:53,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:53,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:54,809 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:29:54,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:54,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:29:54,810 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:54,810 INFO L182 omatonBuilderFactory]: Interpolants [32736#true, 32737#false, 32738#(= |main_#t~malloc0.offset| 0), 32739#(= main_~head~0.offset 0), 32740#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 32741#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 32742#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 32743#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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)), 32744#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0) (not (= main_~x~0.base |main_#t~mem7.base|)) (= (select |#valid| main_~x~0.base) 1)), 32745#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (not (= main_~head~0.base |main_#t~mem9.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32746#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 32747#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32748#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 32749#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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)), 32750#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 32751#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 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)), 32752#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32753#(and (= (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) 1) (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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)))), 32754#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 1) (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))), 32755#(and (= 0 main_~head~0.offset) (= main_~head~0.offset |main_#t~malloc5.offset|) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 32756#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32757#(and (or (and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (not (= main_~x~0.base |main_#t~mem7.base|))), 32758#(or (and (= 12 (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_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32759#(or (and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= 0 |main_#t~mem9.offset|) (= main_~head~0.offset |main_#t~mem9.offset|) (= main_~head~0.base |main_#t~mem9.base|))), 32760#(or (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)) (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)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))))), 32761#(or (and (= 12 (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))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 32762#(or (and (= 0 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))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 32763#(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 (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32764#(or (and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0)) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 32765#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32766#(and (= |main_#t~mem25.offset| 0) (= (select |#length| |main_#t~mem25.base|) 12))] [2018-02-02 10:29:54,810 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:29:54,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:29:54,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:29:54,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:29:54,811 INFO L87 Difference]: Start difference. First operand 437 states and 511 transitions. Second operand 31 states. [2018-02-02 10:29:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:56,805 INFO L93 Difference]: Finished difference Result 515 states and 588 transitions. [2018-02-02 10:29:56,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:29:56,805 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-02-02 10:29:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:56,806 INFO L225 Difference]: With dead ends: 515 [2018-02-02 10:29:56,806 INFO L226 Difference]: Without dead ends: 515 [2018-02-02 10:29:56,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=705, Invalid=3077, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:29:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-02-02 10:29:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 437. [2018-02-02 10:29:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-02-02 10:29:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 510 transitions. [2018-02-02 10:29:56,809 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 510 transitions. Word has length 64 [2018-02-02 10:29:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:56,809 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 510 transitions. [2018-02-02 10:29:56,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:29:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 510 transitions. [2018-02-02 10:29:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:29:56,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:56,810 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:56,810 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:56,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1265713199, now seen corresponding path program 1 times [2018-02-02 10:29:56,810 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:56,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:29:56,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:56,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:29:56,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:56,845 INFO L182 omatonBuilderFactory]: Interpolants [33781#true, 33782#false, 33783#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem30|), 33784#(= main_~t1~0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))), 33785#(and (not (= main_~t1~0 2)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) main_~t1~0)), 33786#(not (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 2)), 33787#(not (= |main_#t~mem33| 2))] [2018-02-02 10:29:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 10:29:56,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:56,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:56,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:56,846 INFO L87 Difference]: Start difference. First operand 437 states and 510 transitions. Second operand 7 states. [2018-02-02 10:29:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:56,964 INFO L93 Difference]: Finished difference Result 468 states and 542 transitions. [2018-02-02 10:29:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:56,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-02-02 10:29:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:56,965 INFO L225 Difference]: With dead ends: 468 [2018-02-02 10:29:56,965 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 10:29:56,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:29:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 10:29:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 457. [2018-02-02 10:29:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-02-02 10:29:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 532 transitions. [2018-02-02 10:29:56,968 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 532 transitions. Word has length 66 [2018-02-02 10:29:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:56,968 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 532 transitions. [2018-02-02 10:29:56,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 532 transitions. [2018-02-02 10:29:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:29:56,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:56,968 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:56,969 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:56,969 INFO L82 PathProgramCache]: Analyzing trace with hash -696238314, now seen corresponding path program 1 times [2018-02-02 10:29:56,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:56,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:57,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:29:57,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,047 INFO L182 omatonBuilderFactory]: Interpolants [34720#(= 1 (select |#valid| main_~x~0.base)), 34721#(= 1 (select |#valid| main_~prev~0.base)), 34722#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset))), 34723#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))), 34724#(= 1 (select |#valid| |main_#t~mem35.base|)), 34715#true, 34716#false, 34717#(= main_~x~0.base main_~head~0.base), 34718#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 34719#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:29:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:57,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:57,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:57,047 INFO L87 Difference]: Start difference. First operand 457 states and 532 transitions. Second operand 10 states. [2018-02-02 10:29:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:57,335 INFO L93 Difference]: Finished difference Result 522 states and 576 transitions. [2018-02-02 10:29:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:29:57,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-02-02 10:29:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:57,337 INFO L225 Difference]: With dead ends: 522 [2018-02-02 10:29:57,337 INFO L226 Difference]: Without dead ends: 522 [2018-02-02 10:29:57,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-02-02 10:29:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 473. [2018-02-02 10:29:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-02-02 10:29:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 554 transitions. [2018-02-02 10:29:57,340 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 554 transitions. Word has length 68 [2018-02-02 10:29:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:57,340 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 554 transitions. [2018-02-02 10:29:57,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 554 transitions. [2018-02-02 10:29:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:29:57,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:57,341 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:57,341 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash -696238313, now seen corresponding path program 1 times [2018-02-02 10:29:57,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:57,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:57,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:29:57,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,538 INFO L182 omatonBuilderFactory]: Interpolants [35744#false, 35745#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 35746#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 35747#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 35748#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 35749#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 35750#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 35751#(and (= 0 main_~prev~0.offset) (<= 12 (select |#length| main_~prev~0.base))), 35752#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.offset) main_~x~0.offset)) (<= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~next~0.base) main_~x~0.offset)))), 35753#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~prev~0.base) main_~prev~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~prev~0.base) main_~prev~0.offset))), 35754#(and (= 0 |main_#t~mem35.offset|) (<= 12 (select |#length| |main_#t~mem35.base|))), 35755#(and (<= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 35743#true] [2018-02-02 10:29:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:57,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:29:57,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:29:57,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:29:57,538 INFO L87 Difference]: Start difference. First operand 473 states and 554 transitions. Second operand 13 states. [2018-02-02 10:29:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:58,050 INFO L93 Difference]: Finished difference Result 608 states and 683 transitions. [2018-02-02 10:29:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:29:58,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-02-02 10:29:58,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:58,051 INFO L225 Difference]: With dead ends: 608 [2018-02-02 10:29:58,051 INFO L226 Difference]: Without dead ends: 608 [2018-02-02 10:29:58,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:29:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-02-02 10:29:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 505. [2018-02-02 10:29:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-02-02 10:29:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 595 transitions. [2018-02-02 10:29:58,055 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 595 transitions. Word has length 68 [2018-02-02 10:29:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:58,055 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 595 transitions. [2018-02-02 10:29:58,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:29:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 595 transitions. [2018-02-02 10:29:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:29:58,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:58,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:58,055 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, 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:29:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1784494775, now seen corresponding path program 1 times [2018-02-02 10:29:58,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:58,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:58,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:58,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:29:58,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:58,643 INFO L182 omatonBuilderFactory]: Interpolants [36893#true, 36894#false, 36895#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 36896#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 36897#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 36898#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 36899#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 36900#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 36901#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 36902#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= main_~x~0.base main_~head~0.base)), 36903#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 36904#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 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))), 36905#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 36906#(and (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem15.base|)) (= (select |#valid| main_~head~0.base) 1) (= main_~head~0.offset 0) (= |main_#t~mem15.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))), 36907#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 36908#(and (not (= main_~head~0.base |main_#t~malloc18.base|)) (= 12 (select |#length| 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~malloc18.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~malloc18.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 36909#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 36910#(and (= 12 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0)), 36911#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 36912#(or (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))) (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12))), 36913#(or (and (<= 0 main_~x~0.offset) (or (not (= main_~x~0.offset 0)) (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)))) (= (select |#length| main_~x~0.base) 12)) (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)))), 36914#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 36915#(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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 36916#(or (= 1 (select |#valid| |main_#t~mem27.base|)) (and (= 0 |main_#t~mem27.offset|) (= 0 |main_#t~mem27.base|))), 36917#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (= 1 (select |#valid| main_~next~0.base))), 36918#(or (= 1 (select |#valid| main_~x~0.base)) (and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))), 36919#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:58,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:29:58,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:29:58,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:29:58,644 INFO L87 Difference]: Start difference. First operand 505 states and 595 transitions. Second operand 27 states. Received shutdown request... [2018-02-02 10:29:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:58,813 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:29:58,817 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:29:58,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:29:58 BoogieIcfgContainer [2018-02-02 10:29:58,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:29:58,818 INFO L168 Benchmark]: Toolchain (without parser) took 52604.10 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 779.6 MB). Free memory was 359.5 MB in the beginning and 613.9 MB in the end (delta: -254.4 MB). Peak memory consumption was 525.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:58,819 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:29:58,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.13 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.3 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:29:58,819 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 343.7 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:29:58,819 INFO L168 Benchmark]: RCFGBuilder took 401.80 ms. Allocated memory is still 402.7 MB. Free memory was 343.7 MB in the beginning and 303.2 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:58,819 INFO L168 Benchmark]: TraceAbstraction took 51989.96 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 779.6 MB). Free memory was 303.2 MB in the beginning and 613.9 MB in the end (delta: -310.7 MB). Peak memory consumption was 468.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:58,821 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 364.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.13 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 346.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 343.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 401.80 ms. Allocated memory is still 402.7 MB. Free memory was 343.7 MB in the beginning and 303.2 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51989.96 ms. Allocated memory was 402.7 MB in the beginning and 1.2 GB in the end (delta: 779.6 MB). Free memory was 303.2 MB in the beginning and 613.9 MB in the end (delta: -310.7 MB). Peak memory consumption was 468.9 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 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (505states) and interpolant automaton (currently 7 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 154 locations, 65 error locations. TIMEOUT Result, 51.9s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5198 SDtfs, 21720 SDslu, 30423 SDs, 0 SdLazy, 48184 SolverSat, 3903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1675 GetRequests, 131 SyntacticMatches, 137 SemanticMatches, 1406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11778 ImplicationChecksByTransitivity, 24.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 42/638 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, 54 MinimizatonAttempts, 3331 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2589 NumberOfCodeBlocks, 2589 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2534 ConstructedInterpolants, 0 QuantifiedInterpolants, 2172701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 17 PerfectInterpolantSequences, 42/638 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-29-58-827.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-29-58-827.csv Completed graceful shutdown