java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:28:12,744 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:28:12,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:28:12,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:28:12,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:28:12,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:28:12,758 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:28:12,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:28:12,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:28:12,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:28:12,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:28:12,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:28:12,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:28:12,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:28:12,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:28:12,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:28:12,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:28:12,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:28:12,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:28:12,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:28:12,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:28:12,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:28:12,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:28:12,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:28:12,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:28:12,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:28:12,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:28:12,777 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:28:12,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:28:12,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:28:12,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:28:12,778 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:28:12,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:28:12,788 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:28:12,789 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:28:12,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:28:12,789 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:28:12,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:28:12,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:28:12,790 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:28:12,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:28:12,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:28:12,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:28:12,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:28:12,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:28:12,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:28:12,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:28:12,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:28:12,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:28:12,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:28:12,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:28:12,832 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:28:12,836 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:28:12,837 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:28:12,837 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:28:12,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:12,962 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:28:12,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:28:12,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:12,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:28:12,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:28:12,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:12" (1/1) ... [2018-02-04 03:28:12,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:12, skipping insertion in model container [2018-02-04 03:28:12,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:12" (1/1) ... [2018-02-04 03:28:12,982 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:13,012 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:13,102 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:13,118 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:13,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13 WrapperNode [2018-02-04 03:28:13,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:13,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:28:13,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:28:13,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:28:13,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (1/1) ... [2018-02-04 03:28:13,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:28:13,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:28:13,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:28:13,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:28:13,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (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-04 03:28:13,206 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:28:13,206 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:28:13,206 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:28:13,206 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:28:13,207 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:28:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:28:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 03:28:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:28:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:28:13,208 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:28:13,629 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:28:13,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:13 BoogieIcfgContainer [2018-02-04 03:28:13,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:28:13,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:28:13,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:28:13,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:28:13,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:28:12" (1/3) ... [2018-02-04 03:28:13,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff5d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:13, skipping insertion in model container [2018-02-04 03:28:13,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:13" (2/3) ... [2018-02-04 03:28:13,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ff5d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:13, skipping insertion in model container [2018-02-04 03:28:13,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:13" (3/3) ... [2018-02-04 03:28:13,635 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:13,642 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:28:13,652 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 57 error locations. [2018-02-04 03:28:13,675 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:28:13,675 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:28:13,675 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:28:13,675 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:28:13,675 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:28:13,675 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:28:13,676 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:28:13,676 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:28:13,676 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:28:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states. [2018-02-04 03:28:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:28:13,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:13,695 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:13,695 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691577, now seen corresponding path program 1 times [2018-02-04 03:28:13,732 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:13,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:13,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:13,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,803 INFO L182 omatonBuilderFactory]: Interpolants [136#true, 137#false, 138#(= 1 (select |#valid| |main_#t~malloc0.base|)), 139#(= 1 (select |#valid| main_~head~0.base))] [2018-02-04 03:28:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:13,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:13,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:13,813 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 4 states. [2018-02-04 03:28:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,049 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2018-02-04 03:28:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:14,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:28:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,057 INFO L225 Difference]: With dead ends: 175 [2018-02-04 03:28:14,057 INFO L226 Difference]: Without dead ends: 166 [2018-02-04 03:28:14,058 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-04 03:28:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-04 03:28:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 124. [2018-02-04 03:28:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:28:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-04 03:28:14,088 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 8 [2018-02-04 03:28:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,089 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-04 03:28:14,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-04 03:28:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:28:14,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,089 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:14,089 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2026691576, now seen corresponding path program 1 times [2018-02-04 03:28:14,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:14,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:14,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,163 INFO L182 omatonBuilderFactory]: Interpolants [441#true, 442#false, 443#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 444#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-04 03:28:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:14,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:14,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:14,165 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 4 states. [2018-02-04 03:28:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,296 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-02-04 03:28:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:14,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:28:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,299 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:28:14,299 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 03:28:14,300 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-04 03:28:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 03:28:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2018-02-04 03:28:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:28:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-02-04 03:28:14,309 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 8 [2018-02-04 03:28:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,309 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-02-04 03:28:14,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-02-04 03:28:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 03:28:14,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:14,310 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337492, now seen corresponding path program 1 times [2018-02-04 03:28:14,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:14,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:14,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,411 INFO L182 omatonBuilderFactory]: Interpolants [720#false, 721#(= (select |#valid| main_~head~0.base) 1), 722#(= (select |#valid| main_~x~0.base) 1), 719#true] [2018-02-04 03:28:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:14,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:14,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:14,412 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2018-02-04 03:28:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,560 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-02-04 03:28:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:14,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 03:28:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,561 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:28:14,561 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:28:14,561 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-04 03:28:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:28:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-02-04 03:28:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:28:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-02-04 03:28:14,567 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 16 [2018-02-04 03:28:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,567 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-02-04 03:28:14,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-02-04 03:28:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 03:28:14,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,568 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:14,568 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2141337493, now seen corresponding path program 1 times [2018-02-04 03:28:14,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:14,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:14,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,693 INFO L182 omatonBuilderFactory]: Interpolants [962#true, 963#false, 964#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 965#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 966#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 967#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 968#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-04 03:28:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:14,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:14,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:14,693 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 7 states. [2018-02-04 03:28:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,962 INFO L93 Difference]: Finished difference Result 193 states and 212 transitions. [2018-02-04 03:28:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:14,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 03:28:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,963 INFO L225 Difference]: With dead ends: 193 [2018-02-04 03:28:14,963 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 03:28:14,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 03:28:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 161. [2018-02-04 03:28:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-04 03:28:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 191 transitions. [2018-02-04 03:28:14,969 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 191 transitions. Word has length 16 [2018-02-04 03:28:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,970 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 191 transitions. [2018-02-04 03:28:14,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 191 transitions. [2018-02-04 03:28:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:14,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,970 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-04 03:28:14,971 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash 535994936, now seen corresponding path program 1 times [2018-02-04 03:28:14,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:15,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:28:15,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,055 INFO L182 omatonBuilderFactory]: Interpolants [1329#true, 1330#false, 1331#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1332#(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))), 1333#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0))] [2018-02-04 03:28:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:15,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:15,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:15,056 INFO L87 Difference]: Start difference. First operand 161 states and 191 transitions. Second operand 5 states. [2018-02-04 03:28:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:15,245 INFO L93 Difference]: Finished difference Result 281 states and 336 transitions. [2018-02-04 03:28:15,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:15,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 03:28:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:15,246 INFO L225 Difference]: With dead ends: 281 [2018-02-04 03:28:15,246 INFO L226 Difference]: Without dead ends: 281 [2018-02-04 03:28:15,247 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-04 03:28:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-04 03:28:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2018-02-04 03:28:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 03:28:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2018-02-04 03:28:15,251 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 18 [2018-02-04 03:28:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:15,251 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2018-02-04 03:28:15,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2018-02-04 03:28:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:15,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:15,252 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-04 03:28:15,252 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 535994935, now seen corresponding path program 1 times [2018-02-04 03:28:15,252 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:15,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:15,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:28:15,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,295 INFO L182 omatonBuilderFactory]: Interpolants [1781#true, 1782#false, 1783#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1784#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1785#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-04 03:28:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:15,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:15,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:15,295 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand 5 states. [2018-02-04 03:28:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:15,450 INFO L93 Difference]: Finished difference Result 273 states and 324 transitions. [2018-02-04 03:28:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:15,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 03:28:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:15,453 INFO L225 Difference]: With dead ends: 273 [2018-02-04 03:28:15,453 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 03:28:15,453 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-04 03:28:15,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 03:28:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 159. [2018-02-04 03:28:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 03:28:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2018-02-04 03:28:15,458 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 18 [2018-02-04 03:28:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:15,459 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2018-02-04 03:28:15,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2018-02-04 03:28:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:28:15,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:15,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:15,460 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -598321662, now seen corresponding path program 1 times [2018-02-04 03:28:15,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:15,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,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-04 03:28:15,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:15,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:15,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,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-04 03:28:15,485 INFO L182 omatonBuilderFactory]: Interpolants [2224#(= 1 (select |#valid| |main_#t~malloc13.base|)), 2225#(= 1 (select |#valid| main_~x~0.base)), 2222#true, 2223#false] [2018-02-04 03:28:15,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-04 03:28:15,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:15,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:15,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:15,486 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand 4 states. [2018-02-04 03:28:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:15,574 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-02-04 03:28:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:15,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 03:28:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:15,576 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:28:15,576 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 03:28:15,576 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-04 03:28:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 03:28:15,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-04 03:28:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 03:28:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2018-02-04 03:28:15,581 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 19 [2018-02-04 03:28:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:15,582 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2018-02-04 03:28:15,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2018-02-04 03:28:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:28:15,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:15,583 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:15,583 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:15,583 INFO L82 PathProgramCache]: Analyzing trace with hash -598321661, now seen corresponding path program 1 times [2018-02-04 03:28:15,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:15,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:15,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:15,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,633 INFO L182 omatonBuilderFactory]: Interpolants [2560#true, 2561#false, 2562#(and (= 12 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 2563#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-04 03:28:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:15,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:15,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:15,633 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand 4 states. [2018-02-04 03:28:15,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:15,712 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-02-04 03:28:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:15,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 03:28:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:15,713 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:28:15,713 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 03:28:15,713 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-04 03:28:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 03:28:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2018-02-04 03:28:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 03:28:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2018-02-04 03:28:15,717 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 19 [2018-02-04 03:28:15,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:15,717 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2018-02-04 03:28:15,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2018-02-04 03:28:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:28:15,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:15,718 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-04 03:28:15,718 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash -992339015, now seen corresponding path program 1 times [2018-02-04 03:28:15,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:15,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:15,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:28:15,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,807 INFO L182 omatonBuilderFactory]: Interpolants [2896#false, 2897#(= (select |#valid| main_~head~0.base) 1), 2898#(= (select |#valid| main_~x~0.base) 1), 2899#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 2900#(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)))), 2901#(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|))), 2902#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2903#(= 1 (select |#valid| |main_#t~mem9.base|)), 2895#true] [2018-02-04 03:28:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:15,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:15,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:15,808 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand 9 states. [2018-02-04 03:28:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:16,097 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2018-02-04 03:28:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:16,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 03:28:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:16,099 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:28:16,099 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:28:16,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:28:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2018-02-04 03:28:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 03:28:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2018-02-04 03:28:16,102 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 22 [2018-02-04 03:28:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:16,106 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-02-04 03:28:16,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2018-02-04 03:28:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 03:28:16,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:16,107 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-04 03:28:16,107 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash -992339014, now seen corresponding path program 1 times [2018-02-04 03:28:16,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:16,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:16,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:16,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:16,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:16,286 INFO L182 omatonBuilderFactory]: Interpolants [3232#(= (select |#valid| main_~head~0.base) 1), 3233#(= (select |#valid| main_~x~0.base) 1), 3234#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 3235#(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))), 3236#(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))), 3237#(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))), 3238#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 3239#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)), 3230#true, 3231#false] [2018-02-04 03:28:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:16,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:16,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:16,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:16,287 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand 10 states. [2018-02-04 03:28:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:16,777 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2018-02-04 03:28:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:28:16,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 03:28:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:16,778 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:28:16,778 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:28:16,778 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:28:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:28:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2018-02-04 03:28:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 03:28:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2018-02-04 03:28:16,780 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 22 [2018-02-04 03:28:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:16,781 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2018-02-04 03:28:16,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2018-02-04 03:28:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:28:16,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28: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] [2018-02-04 03:28:16,782 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:16,782 INFO L82 PathProgramCache]: Analyzing trace with hash 325408366, now seen corresponding path program 1 times [2018-02-04 03:28:16,782 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:16,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:16,844 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-04 03:28:16,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:16,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:16,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:16,845 INFO L182 omatonBuilderFactory]: Interpolants [3562#true, 3563#false, 3564#(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))), 3565#(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))), 3566#(and (= 0 |main_#t~mem17.base|) (= |main_#t~mem17.offset| 0))] [2018-02-04 03:28:16,845 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-04 03:28:16,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:16,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:16,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:16,845 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand 5 states. [2018-02-04 03:28:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:16,985 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2018-02-04 03:28:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:16,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 03:28:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:16,986 INFO L225 Difference]: With dead ends: 157 [2018-02-04 03:28:16,986 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 03:28:16,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 03:28:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2018-02-04 03:28:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 03:28:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2018-02-04 03:28:16,989 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 24 [2018-02-04 03:28:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:16,990 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2018-02-04 03:28:16,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2018-02-04 03:28:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 03:28:16,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:16,991 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:16,991 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1282351166, now seen corresponding path program 1 times [2018-02-04 03:28:16,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:17,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:17,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:28:17,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,045 INFO L182 omatonBuilderFactory]: Interpolants [3876#true, 3877#false, 3878#(and (= 12 (select |#length| |main_#t~malloc13.base|)) (= 0 |main_#t~malloc13.offset|)), 3879#(and (= 12 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3880#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)))] [2018-02-04 03:28:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:17,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:17,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:17,046 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 5 states. [2018-02-04 03:28:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:17,233 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-02-04 03:28:17,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:17,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 03:28:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:17,235 INFO L225 Difference]: With dead ends: 180 [2018-02-04 03:28:17,235 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 03:28:17,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 03:28:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 126. [2018-02-04 03:28:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:28:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-02-04 03:28:17,238 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 25 [2018-02-04 03:28:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:17,241 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-02-04 03:28:17,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-02-04 03:28:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:28:17,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:17,242 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] [2018-02-04 03:28:17,243 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1416942161, now seen corresponding path program 1 times [2018-02-04 03:28:17,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:17,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:17,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:17,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,317 INFO L182 omatonBuilderFactory]: Interpolants [4193#true, 4194#false, 4195#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem17.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4196#(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))), 4197#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|)), 4198#(and (= main_~y~0.offset 0) (= main_~y~0.base 0))] [2018-02-04 03:28:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:17,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:17,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:17,318 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 6 states. [2018-02-04 03:28:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:17,492 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-02-04 03:28:17,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:17,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 03:28:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:17,493 INFO L225 Difference]: With dead ends: 193 [2018-02-04 03:28:17,493 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 03:28:17,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 03:28:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2018-02-04 03:28:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 03:28:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-02-04 03:28:17,497 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 27 [2018-02-04 03:28:17,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:17,497 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-02-04 03:28:17,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-02-04 03:28:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:28:17,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:17,498 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] [2018-02-04 03:28:17,498 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -564778548, now seen corresponding path program 1 times [2018-02-04 03:28:17,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:17,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:17,604 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-04 03:28:17,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:17,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:28:17,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,605 INFO L182 omatonBuilderFactory]: Interpolants [4535#true, 4536#false, 4537#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4538#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 4539#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 4540#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)))), 4541#(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))), 4542#(and (= 0 |main_#t~mem29.offset|) (= 12 (select |#length| |main_#t~mem29.base|))), 4543#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-04 03:28:17,605 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-04 03:28:17,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:17,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:17,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:17,605 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 9 states. [2018-02-04 03:28:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:17,950 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-02-04 03:28:17,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:28:17,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 03:28:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:17,951 INFO L225 Difference]: With dead ends: 217 [2018-02-04 03:28:17,951 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 03:28:17,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 03:28:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 147. [2018-02-04 03:28:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 03:28:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-02-04 03:28:17,955 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 30 [2018-02-04 03:28:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:17,955 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-02-04 03:28:17,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-02-04 03:28:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:28:17,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:17,956 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] [2018-02-04 03:28:17,956 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -564778549, now seen corresponding path program 1 times [2018-02-04 03:28:17,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:17,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:18,036 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-04 03:28:18,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:18,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:28:18,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,037 INFO L182 omatonBuilderFactory]: Interpolants [4928#(= 1 (select |#valid| main_~head~0.base)), 4929#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base |main_#t~malloc13.base|)), 4930#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 4931#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset))), 4932#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 4933#(= 1 (select |#valid| |main_#t~mem29.base|)), 4934#(= 1 (select |#valid| main_~x~0.base)), 4926#true, 4927#false] [2018-02-04 03:28:18,038 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-04 03:28:18,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:18,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:18,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:18,038 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 9 states. [2018-02-04 03:28:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:18,328 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2018-02-04 03:28:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:18,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 03:28:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:18,358 INFO L225 Difference]: With dead ends: 183 [2018-02-04 03:28:18,358 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 03:28:18,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 03:28:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2018-02-04 03:28:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 03:28:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 165 transitions. [2018-02-04 03:28:18,362 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 165 transitions. Word has length 30 [2018-02-04 03:28:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:18,362 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 165 transitions. [2018-02-04 03:28:18,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 165 transitions. [2018-02-04 03:28:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:28:18,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:18,363 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] [2018-02-04 03:28:18,364 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -378826896, now seen corresponding path program 1 times [2018-02-04 03:28:18,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:18,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:18,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:28:18,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,457 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| |main_#t~mem30.base|)), 5282#(= (select |#valid| main_~x~0.base) 1), 5274#true, 5275#false, 5276#(= 1 (select |#valid| main_~head~0.base)), 5277#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base |main_#t~malloc13.base|)), 5278#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 5279#(= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)))] [2018-02-04 03:28:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:18,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:18,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:18,457 INFO L87 Difference]: Start difference. First operand 144 states and 165 transitions. Second operand 9 states. [2018-02-04 03:28:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:18,639 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2018-02-04 03:28:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:18,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 03:28:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:18,641 INFO L225 Difference]: With dead ends: 188 [2018-02-04 03:28:18,641 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 03:28:18,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 03:28:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 149. [2018-02-04 03:28:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 03:28:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-02-04 03:28:18,644 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 31 [2018-02-04 03:28:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:18,645 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-02-04 03:28:18,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-02-04 03:28:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:28:18,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:18,645 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] [2018-02-04 03:28:18,645 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -378826895, now seen corresponding path program 1 times [2018-02-04 03:28:18,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:18,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:18,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:28:18,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,776 INFO L182 omatonBuilderFactory]: Interpolants [5632#true, 5633#false, 5634#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 5635#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 5636#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 5637#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)))), 5638#(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))), 5639#(and (= 0 |main_#t~mem30.offset|) (= 12 (select |#length| |main_#t~mem30.base|))), 5640#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset))] [2018-02-04 03:28:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:18,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:18,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:18,777 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 9 states. [2018-02-04 03:28:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:19,086 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2018-02-04 03:28:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:28:19,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 03:28:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:19,087 INFO L225 Difference]: With dead ends: 220 [2018-02-04 03:28:19,087 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 03:28:19,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 03:28:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 151. [2018-02-04 03:28:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 03:28:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2018-02-04 03:28:19,089 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 31 [2018-02-04 03:28:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:19,089 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2018-02-04 03:28:19,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2018-02-04 03:28:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:28:19,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:19,090 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] [2018-02-04 03:28:19,090 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1710617177, now seen corresponding path program 1 times [2018-02-04 03:28:19,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:19,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:19,210 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-04 03:28:19,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:19,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:19,210 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,211 INFO L182 omatonBuilderFactory]: Interpolants [6032#(= 0 |main_#t~malloc0.offset|), 6033#(= main_~head~0.offset 0), 6034#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 6035#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 6036#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))) (= main_~head~0.offset 0)), 6037#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))), 6038#(= 1 |main_#t~mem28|), 6030#true, 6031#false] [2018-02-04 03:28:19,211 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-04 03:28:19,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:19,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:19,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:19,212 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand 9 states. [2018-02-04 03:28:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:19,437 INFO L93 Difference]: Finished difference Result 238 states and 261 transitions. [2018-02-04 03:28:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:19,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 03:28:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:19,438 INFO L225 Difference]: With dead ends: 238 [2018-02-04 03:28:19,438 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 03:28:19,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:28:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 03:28:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2018-02-04 03:28:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-04 03:28:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2018-02-04 03:28:19,442 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 34 [2018-02-04 03:28:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:19,443 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2018-02-04 03:28:19,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2018-02-04 03:28:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:28:19,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:19,443 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] [2018-02-04 03:28:19,444 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1438963843, now seen corresponding path program 1 times [2018-02-04 03:28:19,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:19,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:19,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-04 03:28:19,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:19,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:28:19,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:19,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-04 03:28:19,523 INFO L182 omatonBuilderFactory]: Interpolants [6448#false, 6449#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6450#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem17.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem17.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6451#(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))), 6452#(and (= 0 |main_#t~mem20.offset|) (= 0 |main_#t~mem20.base|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6453#(and (= 0 main_~y~0.base) (= main_~x~0.offset main_~head~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base main_~head~0.base)), 6454#(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))), 6455#(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))), 6456#(and (= 0 |main_#t~mem30.offset|) (= 0 |main_#t~mem30.base|)), 6457#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 6447#true] [2018-02-04 03:28:19,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-04 03:28:19,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:19,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:19,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:19,524 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand 11 states. [2018-02-04 03:28:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:19,894 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2018-02-04 03:28:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:19,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 03:28:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:19,896 INFO L225 Difference]: With dead ends: 208 [2018-02-04 03:28:19,896 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 03:28:19,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 03:28:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2018-02-04 03:28:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:28:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2018-02-04 03:28:19,899 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 35 [2018-02-04 03:28:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:19,899 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2018-02-04 03:28:19,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2018-02-04 03:28:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:28:19,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:19,900 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] [2018-02-04 03:28:19,900 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 536373049, now seen corresponding path program 1 times [2018-02-04 03:28:19,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:19,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:19,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:19,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,945 INFO L182 omatonBuilderFactory]: Interpolants [6848#(not (= 0 main_~head~0.base)), 6844#true, 6845#false, 6846#(not (= 0 |main_#t~malloc13.base|)), 6847#(not (= 0 main_~x~0.base))] [2018-02-04 03:28:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:19,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:19,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:19,945 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand 5 states. [2018-02-04 03:28:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:20,034 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2018-02-04 03:28:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:20,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:28:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:20,035 INFO L225 Difference]: With dead ends: 211 [2018-02-04 03:28:20,035 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 03:28:20,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-04 03:28:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 03:28:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-02-04 03:28:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:28:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2018-02-04 03:28:20,039 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 35 [2018-02-04 03:28:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:20,039 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2018-02-04 03:28:20,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2018-02-04 03:28:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:28:20,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:20,040 INFO L351 BasicCegarLoop]: trace histogram [3, 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-04 03:28:20,040 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash -27290110, now seen corresponding path program 2 times [2018-02-04 03:28:20,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:20,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:20,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:20,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:28:20,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:20,206 INFO L182 omatonBuilderFactory]: Interpolants [7251#true, 7252#false, 7253#(= 0 |main_#t~malloc0.offset|), 7254#(= main_~head~0.offset 0), 7255#(and (= main_~head~0.offset 0) (= 0 |main_#t~malloc13.offset|)), 7256#(and (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 7257#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 7258#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= 0 main_~x~0.offset)), 7259#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ 0 8)))), 7260#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))), 7261#(= 1 |main_#t~mem28|)] [2018-02-04 03:28:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:20,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:20,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:20,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:20,207 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 11 states. [2018-02-04 03:28:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:20,503 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2018-02-04 03:28:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:28:20,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 03:28:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:20,504 INFO L225 Difference]: With dead ends: 202 [2018-02-04 03:28:20,504 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 03:28:20,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:28:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 03:28:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2018-02-04 03:28:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 03:28:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2018-02-04 03:28:20,506 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 35 [2018-02-04 03:28:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:20,506 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2018-02-04 03:28:20,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2018-02-04 03:28:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:28:20,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:20,507 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] [2018-02-04 03:28:20,507 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash -980733601, now seen corresponding path program 1 times [2018-02-04 03:28:20,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:20,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:20,616 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-04 03:28:20,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:20,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:28:20,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:20,617 INFO L182 omatonBuilderFactory]: Interpolants [7657#true, 7658#false, 7659#(= (select |#valid| main_~head~0.base) 1), 7660#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7661#(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)), 7662#(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)), 7663#(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|))), 7664#(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)))), 7665#(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))), 7666#(= 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))), 7667#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7668#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7669#(= 1 (select |#valid| |main_#t~mem19.base|)), 7670#(= 1 (select |#valid| main_~x~0.base))] [2018-02-04 03:28:20,617 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-04 03:28:20,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:20,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:20,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:20,617 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand 14 states. [2018-02-04 03:28:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:21,102 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2018-02-04 03:28:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:21,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-04 03:28:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:21,103 INFO L225 Difference]: With dead ends: 253 [2018-02-04 03:28:21,103 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 03:28:21,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:28:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 03:28:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2018-02-04 03:28:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 03:28:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 223 transitions. [2018-02-04 03:28:21,106 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 223 transitions. Word has length 36 [2018-02-04 03:28:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:21,106 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 223 transitions. [2018-02-04 03:28:21,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 223 transitions. [2018-02-04 03:28:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:28:21,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:21,107 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] [2018-02-04 03:28:21,107 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash -980733600, now seen corresponding path program 1 times [2018-02-04 03:28:21,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:21,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:21,247 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-04 03:28:21,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:21,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:28:21,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:21,248 INFO L182 omatonBuilderFactory]: Interpolants [8145#true, 8146#false, 8147#(= (select |#valid| main_~head~0.base) 1), 8148#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8149#(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)), 8150#(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)), 8151#(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|))), 8152#(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))), 8153#(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))), 8154#(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 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)))), 8155#(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))), 8156#(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))), 8157#(and (= 12 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 8158#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-04 03:28:21,248 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-04 03:28:21,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:21,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:21,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:21,249 INFO L87 Difference]: Start difference. First operand 193 states and 223 transitions. Second operand 14 states. [2018-02-04 03:28:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:21,987 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2018-02-04 03:28:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:28:21,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-04 03:28:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:21,988 INFO L225 Difference]: With dead ends: 275 [2018-02-04 03:28:21,988 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 03:28:21,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:28:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 03:28:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 208. [2018-02-04 03:28:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 03:28:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2018-02-04 03:28:21,990 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 36 [2018-02-04 03:28:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:21,990 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2018-02-04 03:28:21,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2018-02-04 03:28:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:28:21,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:21,991 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] [2018-02-04 03:28:21,991 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1248109266, now seen corresponding path program 1 times [2018-02-04 03:28:21,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:21,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:22,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:28:22,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,146 INFO L182 omatonBuilderFactory]: Interpolants [8672#(and (= 0 |main_#t~mem32.offset|) (= 0 |main_#t~mem32.base|)), 8673#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 8662#true, 8663#false, 8664#(and (= (select |#valid| main_~head~0.base) 1) (= 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))), 8665#(and (not (= main_~head~0.base |main_#t~malloc13.base|)) (= 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))), 8666#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8667#(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 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) 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 4) 0)) (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset)))), 8668#(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)))), 8669#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 8670#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem30.base|) |main_#t~mem30.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem30.base|) |main_#t~mem30.offset|))), 8671#(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)))] [2018-02-04 03:28:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:28:22,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:28:22,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:28:22,146 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand 12 states. [2018-02-04 03:28:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:22,499 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2018-02-04 03:28:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:22,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-02-04 03:28:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:22,500 INFO L225 Difference]: With dead ends: 244 [2018-02-04 03:28:22,500 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 03:28:22,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:28:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 03:28:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2018-02-04 03:28:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 03:28:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 261 transitions. [2018-02-04 03:28:22,504 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 261 transitions. Word has length 37 [2018-02-04 03:28:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:22,504 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 261 transitions. [2018-02-04 03:28:22,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:28:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 261 transitions. [2018-02-04 03:28:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:22,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:22,505 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] [2018-02-04 03:28:22,505 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1114575156, now seen corresponding path program 1 times [2018-02-04 03:28:22,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:22,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:22,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:22,546 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,547 INFO L182 omatonBuilderFactory]: Interpolants [9168#(not (= 0 |main_#t~malloc0.base|)), 9169#(not (= 0 main_~head~0.base)), 9170#(not (= 0 main_~x~0.base)), 9166#true, 9167#false] [2018-02-04 03:28:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:22,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:22,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:22,548 INFO L87 Difference]: Start difference. First operand 228 states and 261 transitions. Second operand 5 states. [2018-02-04 03:28:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:22,647 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2018-02-04 03:28:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:22,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 03:28:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:22,648 INFO L225 Difference]: With dead ends: 252 [2018-02-04 03:28:22,649 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 03:28:22,649 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-04 03:28:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 03:28:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 217. [2018-02-04 03:28:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 03:28:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-02-04 03:28:22,652 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 39 [2018-02-04 03:28:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:22,653 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-02-04 03:28:22,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-02-04 03:28:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:22,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:22,653 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] [2018-02-04 03:28:22,654 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1798109331, now seen corresponding path program 1 times [2018-02-04 03:28:22,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:22,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:22,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:28:22,723 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,724 INFO L182 omatonBuilderFactory]: Interpolants [9648#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 9649#(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))), 9650#(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))), 9651#(and (= 0 |main_#t~mem33.offset|) (= 0 |main_#t~mem33.base|)), 9652#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 9644#true, 9645#false, 9646#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9647#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem30.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem30.base|))] [2018-02-04 03:28:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:22,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:22,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:22,725 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 9 states. [2018-02-04 03:28:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:23,005 INFO L93 Difference]: Finished difference Result 256 states and 284 transitions. [2018-02-04 03:28:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:28:23,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 03:28:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:23,006 INFO L225 Difference]: With dead ends: 256 [2018-02-04 03:28:23,006 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 03:28:23,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 03:28:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2018-02-04 03:28:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-04 03:28:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2018-02-04 03:28:23,009 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 39 [2018-02-04 03:28:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:23,009 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-02-04 03:28:23,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2018-02-04 03:28:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:28:23,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:23,009 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] [2018-02-04 03:28:23,009 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -93187018, now seen corresponding path program 1 times [2018-02-04 03:28:23,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:23,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:23,065 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-04 03:28:23,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:23,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:28:23,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:23,066 INFO L182 omatonBuilderFactory]: Interpolants [10148#true, 10149#false, 10150#(not (= 0 |main_#t~malloc0.base|)), 10151#(not (= 0 main_~head~0.base)), 10152#(not (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) 0) main_~x~0.offset))), 10153#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10154#(not (= 0 |main_#t~mem33.base|)), 10155#(not (= 0 main_~x~0.base))] [2018-02-04 03:28:23,066 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-04 03:28:23,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:23,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:23,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:23,066 INFO L87 Difference]: Start difference. First operand 230 states and 259 transitions. Second operand 8 states. [2018-02-04 03:28:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:23,236 INFO L93 Difference]: Finished difference Result 278 states and 307 transitions. [2018-02-04 03:28:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:23,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-04 03:28:23,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:23,237 INFO L225 Difference]: With dead ends: 278 [2018-02-04 03:28:23,237 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 03:28:23,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 03:28:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2018-02-04 03:28:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 03:28:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2018-02-04 03:28:23,241 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 40 [2018-02-04 03:28:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:23,241 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2018-02-04 03:28:23,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2018-02-04 03:28:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:28:23,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:23,242 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-04 03:28:23,242 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:23,242 INFO L82 PathProgramCache]: Analyzing trace with hash 244231616, now seen corresponding path program 1 times [2018-02-04 03:28:23,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:23,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:23,449 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-04 03:28:23,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:23,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:28:23,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:23,450 INFO L182 omatonBuilderFactory]: Interpolants [10692#true, 10693#false, 10694#(= (select |#valid| main_~head~0.base) 1), 10695#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10696#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~x~0.base main_~head~0.base)), 10697#(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) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= main_~x~0.base main_~head~0.base)), 10698#(and (= main_~x~0.offset main_~head~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 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|))), 10699#(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)))), 10700#(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))), 10701#(= (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), 10702#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 10703#(= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1), 10704#(= (select |#valid| |main_#t~mem20.base|) 1), 10705#(= (select |#valid| main_~y~0.base) 1)] [2018-02-04 03:28:23,450 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-04 03:28:23,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:23,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:23,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:23,451 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand 14 states. [2018-02-04 03:28:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:24,011 INFO L93 Difference]: Finished difference Result 409 states and 452 transitions. [2018-02-04 03:28:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:28:24,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-04 03:28:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:24,012 INFO L225 Difference]: With dead ends: 409 [2018-02-04 03:28:24,012 INFO L226 Difference]: Without dead ends: 409 [2018-02-04 03:28:24,012 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:28:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-04 03:28:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 251. [2018-02-04 03:28:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 03:28:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2018-02-04 03:28:24,016 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 40 [2018-02-04 03:28:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:24,016 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2018-02-04 03:28:24,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2018-02-04 03:28:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:28:24,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:24,017 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-04 03:28:24,017 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 244231617, now seen corresponding path program 1 times [2018-02-04 03:28:24,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:24,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:24,289 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-04 03:28:24,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:24,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:28:24,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:24,289 INFO L182 omatonBuilderFactory]: Interpolants [11400#true, 11401#false, 11402#(= (select |#valid| main_~head~0.base) 1), 11403#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 11404#(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)), 11405#(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)), 11406#(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|))), 11407#(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))), 11408#(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))), 11409#(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 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)))), 11410#(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))), 11411#(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))), 11412#(and (= 0 |main_#t~mem20.offset|) (= 12 (select |#length| |main_#t~mem20.base|))), 11413#(and (= 12 (select |#length| main_~y~0.base)) (= main_~y~0.offset 0))] [2018-02-04 03:28:24,290 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-04 03:28:24,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:24,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:24,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:24,290 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand 14 states. [2018-02-04 03:28:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:25,011 INFO L93 Difference]: Finished difference Result 406 states and 446 transitions. [2018-02-04 03:28:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:28:25,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-02-04 03:28:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:25,012 INFO L225 Difference]: With dead ends: 406 [2018-02-04 03:28:25,012 INFO L226 Difference]: Without dead ends: 406 [2018-02-04 03:28:25,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2018-02-04 03:28:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-04 03:28:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 254. [2018-02-04 03:28:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-04 03:28:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2018-02-04 03:28:25,016 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 40 [2018-02-04 03:28:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:25,016 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2018-02-04 03:28:25,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2018-02-04 03:28:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:28:25,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:25,016 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 03:28:25,016 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 926672937, now seen corresponding path program 2 times [2018-02-04 03:28:25,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:25,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:25,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:28:25,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,167 INFO L182 omatonBuilderFactory]: Interpolants [12106#true, 12107#false, 12108#(= (select |#valid| main_~head~0.base) 1), 12109#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 12110#(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)), 12111#(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)), 12112#(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|))), 12113#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 12114#(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))), 12115#(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))), 12116#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12117#(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)))), 12118#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) |main_#t~mem19.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) |main_#t~mem19.offset|))), 12119#(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))), 12120#(and (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem17.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-04 03:28:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:28:25,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:28:25,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:25,168 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand 15 states. [2018-02-04 03:28:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:25,757 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2018-02-04 03:28:25,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:25,761 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-02-04 03:28:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:25,761 INFO L225 Difference]: With dead ends: 271 [2018-02-04 03:28:25,761 INFO L226 Difference]: Without dead ends: 271 [2018-02-04 03:28:25,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:28:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-04 03:28:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 246. [2018-02-04 03:28:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 03:28:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 275 transitions. [2018-02-04 03:28:25,765 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 275 transitions. Word has length 42 [2018-02-04 03:28:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:25,765 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 275 transitions. [2018-02-04 03:28:25,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:28:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 275 transitions. [2018-02-04 03:28:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:28:25,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:25,766 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] [2018-02-04 03:28:25,766 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr56EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1961775235, now seen corresponding path program 1 times [2018-02-04 03:28:25,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:25,815 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:28:25,830 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:28:25,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:28:25 BoogieIcfgContainer [2018-02-04 03:28:25,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:28:25,844 INFO L168 Benchmark]: Toolchain (without parser) took 12881.50 ms. Allocated memory was 402.7 MB in the beginning and 815.8 MB in the end (delta: 413.1 MB). Free memory was 359.3 MB in the beginning and 639.1 MB in the end (delta: -279.7 MB). Peak memory consumption was 133.4 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:25,845 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:28:25,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.76 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 347.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:25,846 INFO L168 Benchmark]: Boogie Preprocessor took 33.91 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:25,846 INFO L168 Benchmark]: RCFGBuilder took 469.51 ms. Allocated memory is still 402.7 MB. Free memory was 344.7 MB in the beginning and 307.2 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:25,846 INFO L168 Benchmark]: TraceAbstraction took 12213.46 ms. Allocated memory was 402.7 MB in the beginning and 815.8 MB in the end (delta: 413.1 MB). Free memory was 307.2 MB in the beginning and 639.1 MB in the end (delta: -331.8 MB). Peak memory consumption was 81.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:25,847 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.17 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.76 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 347.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.91 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 344.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 469.51 ms. Allocated memory is still 402.7 MB. Free memory was 344.7 MB in the beginning and 307.2 MB in the end (delta: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12213.46 ms. Allocated memory was 402.7 MB in the beginning and 815.8 MB in the end (delta: 413.1 MB). Free memory was 307.2 MB in the beginning and 639.1 MB in the end (delta: -331.8 MB). Peak memory consumption was 81.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 986]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 986. Possible FailurePath: [L989] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={19:0}] [L989] SLL* head = malloc(sizeof(SLL)); VAL [head={19:0}, malloc(sizeof(SLL))={19:0}] [L990] FCALL head->next = ((void*)0) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}] [L991] FCALL head->prev = ((void*)0) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}] [L992] FCALL head->data = 0 VAL [head={19:0}, malloc(sizeof(SLL))={19:0}] [L994] SLL* x = head; VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, x={19:0}] [L997] COND FALSE !(__VERIFIER_nondet_int()) [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x = head VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, x={19:0}] [L1019] EXPR, FCALL x->next VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, x={19:0}, x->next={0:0}] [L1019] COND FALSE !(x->next != ((void*)0)) [L1026] EXPR, FCALL x->next VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, x={19:0}, x->next={0:0}] [L1026] SLL* y = x->next; [L1027] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1027] FCALL x->next = malloc(sizeof(SLL)) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1028] FCALL x->data = 1 VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1029] FCALL x->next = y VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1030] COND FALSE !(y != ((void*)0)) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1038] x = head VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1041] EXPR, FCALL x->data VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, x->data=1, y={0:0}] [L1041] COND FALSE !(x->data != 1) [L1047] EXPR, FCALL x->next VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, x->next={0:0}, y={0:0}] [L1047] x = x->next [L1048] COND FALSE !(\read(*x)) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={0:0}, y={0:0}] [L1056] x = head VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1057] COND TRUE x != ((void*)0) [L1059] head = x VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, y={0:0}] [L1060] EXPR, FCALL x->next VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={19:0}, x->next={0:0}, y={0:0}] [L1060] x = x->next [L1061] FCALL free(head) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={0:0}, y={0:0}] [L1057] COND FALSE !(x != ((void*)0)) VAL [head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={0:0}, y={0:0}] [L1064] return 0; VAL [\result=0, head={19:0}, malloc(sizeof(SLL))={19:0}, malloc(sizeof(SLL))={22:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 57 error locations. UNSAFE Result, 12.1s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2412 SDtfs, 7050 SDslu, 7409 SDs, 0 SdLazy, 11514 SolverSat, 1094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 53 SyntacticMatches, 33 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 22/54 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 1489 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 822 ConstructedInterpolants, 0 QuantifiedInterpolants, 211241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 22/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-28-25-853.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-28-25-853.csv Received shutdown request...