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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:48:57,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:48:57,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:48:57,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:48:57,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:48:57,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:48:57,816 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:48:57,817 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:48:57,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:48:57,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:48:57,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:48:57,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:48:57,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:48:57,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:48:57,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:48:57,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:48:57,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:48:57,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:48:57,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:48:57,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:48:57,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:48:57,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:48:57,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:48:57,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:48:57,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:48:57,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:48:57,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:48:57,836 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:48:57,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:48:57,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:48:57,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:48:57,837 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 02:48:57,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:48:57,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:48:57,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:48:57,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:48:57,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:48:57,848 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:48:57,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:48:57,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:48:57,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:48:57,850 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:48:57,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:48:57,882 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:48:57,885 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:48:57,886 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:48:57,886 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:48:57,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-02-04 02:48:58,021 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:48:58,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:48:58,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:48:58,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:48:58,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:48:58,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1babdffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58, skipping insertion in model container [2018-02-04 02:48:58,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:48:58,072 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:48:58,162 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:48:58,180 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:48:58,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58 WrapperNode [2018-02-04 02:48:58,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:48:58,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:48:58,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:48:58,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:48:58,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (1/1) ... [2018-02-04 02:48:58,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:48:58,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:48:58,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:48:58,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:48:58,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (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 02:48:58,263 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:48:58,263 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:48:58,263 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:48:58,264 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:48:58,265 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:48:58,579 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:48:58,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:48:58 BoogieIcfgContainer [2018-02-04 02:48:58,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:48:58,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:48:58,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:48:58,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:48:58,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:48:58" (1/3) ... [2018-02-04 02:48:58,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521f40a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:48:58, skipping insertion in model container [2018-02-04 02:48:58,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:48:58" (2/3) ... [2018-02-04 02:48:58,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521f40a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:48:58, skipping insertion in model container [2018-02-04 02:48:58,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:48:58" (3/3) ... [2018-02-04 02:48:58,585 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-02-04 02:48:58,592 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:48:58,598 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-02-04 02:48:58,629 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:48:58,629 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:48:58,629 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:48:58,629 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:48:58,629 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:48:58,630 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:48:58,630 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:48:58,630 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:48:58,631 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:48:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-02-04 02:48:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 02:48:58,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:58,651 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:58,651 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-02-04 02:48:58,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:58,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:58,761 INFO 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 02:48:58,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:58,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:48:58,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:58,764 INFO 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 02:48:58,765 INFO L182 omatonBuilderFactory]: Interpolants [104#true, 105#false] [2018-02-04 02:48:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:48:58,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:48:58,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:48:58,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:48:58,780 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-02-04 02:48:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:58,863 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-04 02:48:58,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:48:58,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-04 02:48:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:58,872 INFO L225 Difference]: With dead ends: 101 [2018-02-04 02:48:58,872 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 02:48:58,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:48:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 02:48:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 02:48:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 02:48:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-02-04 02:48:58,902 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-02-04 02:48:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:58,903 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-02-04 02:48:58,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:48:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-02-04 02:48:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:48:58,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:58,903 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:58,903 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-02-04 02:48:58,905 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:58,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:58,955 INFO 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 02:48:58,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:58,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:58,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:58,956 INFO 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 02:48:58,956 INFO L182 omatonBuilderFactory]: Interpolants [305#true, 306#false, 307#(= main_~c1~0 0)] [2018-02-04 02:48:58,956 INFO 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 02:48:58,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:48:58,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:48:58,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:58,958 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-02-04 02:48:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:58,981 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-02-04 02:48:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:48:58,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 02:48:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:58,982 INFO L225 Difference]: With dead ends: 107 [2018-02-04 02:48:58,983 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 02:48:58,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 02:48:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-02-04 02:48:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-04 02:48:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-02-04 02:48:58,990 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-02-04 02:48:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:58,990 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-02-04 02:48:58,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:48:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-02-04 02:48:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:48:58,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:58,991 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:58,991 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-02-04 02:48:58,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,033 INFO 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 02:48:59,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:59,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,034 INFO 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 02:48:59,034 INFO L182 omatonBuilderFactory]: Interpolants [519#true, 520#false, 521#(= 1 (select |#valid| |main_#t~malloc3.base|)), 522#(= 1 (select |#valid| main_~x~0.base))] [2018-02-04 02:48:59,034 INFO 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 02:48:59,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:48:59,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:48:59,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:48:59,035 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-02-04 02:48:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,159 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-02-04 02:48:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:48:59,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:48:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,161 INFO L225 Difference]: With dead ends: 127 [2018-02-04 02:48:59,162 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 02:48:59,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:48:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 02:48:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 02:48:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 02:48:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-04 02:48:59,168 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-02-04 02:48:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,169 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-04 02:48:59,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:48:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-04 02:48:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:48:59,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,170 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:59,170 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-02-04 02:48:59,170 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,228 INFO 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 02:48:59,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:59,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,228 INFO 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 02:48:59,229 INFO L182 omatonBuilderFactory]: Interpolants [752#(and (= (select |#length| main_~x~0.base) 20) (= main_~x~0.offset 0)), 749#true, 750#false, 751#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|))] [2018-02-04 02:48:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:48:59,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:48:59,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:48:59,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:48:59,229 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-02-04 02:48:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,335 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-02-04 02:48:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:48:59,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:48:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,336 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:48:59,336 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 02:48:59,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 02:48:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 02:48:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-02-04 02:48:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 02:48:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-04 02:48:59,342 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-02-04 02:48:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,342 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-04 02:48:59,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:48:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-04 02:48:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:48:59,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,343 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:59,343 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-02-04 02:48:59,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,368 INFO 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 02:48:59,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:48:59,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:48:59,369 INFO L182 omatonBuilderFactory]: Interpolants [993#true, 994#false, 995#(= |#valid| |old(#valid)|)] [2018-02-04 02:48:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:48:59,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:48:59,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:48:59,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:59,370 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-02-04 02:48:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,401 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-02-04 02:48:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:48:59,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 02:48:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,402 INFO L225 Difference]: With dead ends: 102 [2018-02-04 02:48:59,402 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 02:48:59,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 02:48:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-02-04 02:48:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 02:48:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-02-04 02:48:59,405 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-02-04 02:48:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,406 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-02-04 02:48:59,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:48:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-02-04 02:48:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:48:59,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,406 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] [2018-02-04 02:48:59,406 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-02-04 02:48:59,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,463 INFO 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 02:48:59,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:59,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,464 INFO 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 02:48:59,464 INFO L182 omatonBuilderFactory]: Interpolants [1195#true, 1196#false, 1197#(and (= main_~first~0.offset 0) (= main_~first~0.base 0))] [2018-02-04 02:48:59,464 INFO 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 02:48:59,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:48:59,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:48:59,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:59,465 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-02-04 02:48:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,475 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2018-02-04 02:48:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:48:59,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-02-04 02:48:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,476 INFO L225 Difference]: With dead ends: 143 [2018-02-04 02:48:59,476 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:48:59,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:48:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:48:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-02-04 02:48:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 02:48:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-02-04 02:48:59,482 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-02-04 02:48:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,483 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-02-04 02:48:59,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:48:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-02-04 02:48:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:48:59,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,484 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 02:48:59,484 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-02-04 02:48:59,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:48:59,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:48:59,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,588 INFO 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 02:48:59,588 INFO L182 omatonBuilderFactory]: Interpolants [1466#true, 1467#false, 1468#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 1469#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1470#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-02-04 02:48:59,589 INFO 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 02:48:59,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:48:59,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:48:59,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:48:59,589 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-02-04 02:48:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,739 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2018-02-04 02:48:59,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:48:59,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 02:48:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,741 INFO L225 Difference]: With dead ends: 225 [2018-02-04 02:48:59,741 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 02:48:59,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:48:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 02:48:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-02-04 02:48:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:48:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-02-04 02:48:59,747 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-02-04 02:48:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,747 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-02-04 02:48:59,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:48:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-02-04 02:48:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 02:48:59,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:59,748 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-02-04 02:48:59,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,789 INFO 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 02:48:59,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:59,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,790 INFO 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 02:48:59,790 INFO L182 omatonBuilderFactory]: Interpolants [1815#true, 1816#false, 1817#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1818#(= 1 (select |#valid| main_~y~0.base))] [2018-02-04 02:48:59,790 INFO 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 02:48:59,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:48:59,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:48:59,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:48:59,791 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-02-04 02:48:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:48:59,895 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2018-02-04 02:48:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:48:59,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 02:48:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:48:59,896 INFO L225 Difference]: With dead ends: 171 [2018-02-04 02:48:59,896 INFO L226 Difference]: Without dead ends: 171 [2018-02-04 02:48:59,896 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 02:48:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-04 02:48:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-02-04 02:48:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 02:48:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-02-04 02:48:59,900 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-02-04 02:48:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:48:59,901 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-02-04 02:48:59,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:48:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-02-04 02:48:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 02:48:59,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:48:59,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:48:59,902 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:48:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-02-04 02:48:59,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:48:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:48:59,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:48:59,997 INFO 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 02:48:59,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:48:59,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:48:59,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:48:59,997 INFO 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 02:48:59,998 INFO L182 omatonBuilderFactory]: Interpolants [2102#true, 2103#false, 2104#(and (= 0 |main_#t~malloc12.offset|) (= 12 (select |#length| |main_#t~malloc12.base|))), 2105#(and (= main_~y~0.offset 0) (= (select |#length| main_~y~0.base) 12))] [2018-02-04 02:48:59,998 INFO 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 02:48:59,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:48:59,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:48:59,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:48:59,998 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-02-04 02:49:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:00,071 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-02-04 02:49:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:49:00,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 02:49:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:00,073 INFO L225 Difference]: With dead ends: 159 [2018-02-04 02:49:00,073 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 02:49:00,073 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 02:49:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 02:49:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-02-04 02:49:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:49:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-02-04 02:49:00,075 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-02-04 02:49:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:00,075 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-02-04 02:49:00,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:49:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-02-04 02:49:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:49:00,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:00,076 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 02:49:00,076 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-02-04 02:49:00,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:00,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:00,127 INFO 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 02:49:00,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:00,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:49:00,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:00,128 INFO 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 02:49:00,128 INFO L182 omatonBuilderFactory]: Interpolants [2373#true, 2374#false, 2375#(= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)), 2376#(= 1 (select |#valid| |main_#t~mem14.base|)), 2377#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))), 2378#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-04 02:49:00,128 INFO 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 02:49:00,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:49:00,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:49:00,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:49:00,129 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-02-04 02:49:00,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:00,264 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2018-02-04 02:49:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 02:49:00,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 02:49:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:00,267 INFO L225 Difference]: With dead ends: 185 [2018-02-04 02:49:00,267 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 02:49:00,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:49:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 02:49:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-02-04 02:49:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 02:49:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-02-04 02:49:00,270 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-02-04 02:49:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:00,271 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-02-04 02:49:00,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:49:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-02-04 02:49:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:49:00,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:00,272 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 02:49:00,272 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-02-04 02:49:00,273 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:00,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:00,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:00,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:49:00,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:00,509 INFO L182 omatonBuilderFactory]: Interpolants [2704#(and (= (select |#length| main_~x~0.base) 20) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 2705#(and (= (select |#length| main_~x~0.base) 20) (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 2706#(and (not (= main_~x~0.base |main_#t~malloc12.base|)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2707#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (<= 20 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2708#(and (<= 20 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2709#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (<= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)))), 2710#(and (<= 20 (select |#length| |main_#t~mem15.base|)) (= |main_#t~mem15.offset| 0)), 2700#true, 2701#false, 2702#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 2703#(and (= (select |#length| main_~x~0.base) 20) (= 0 main_~x~0.offset))] [2018-02-04 02:49:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:00,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:49:00,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:49:00,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:49:00,510 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 11 states. [2018-02-04 02:49:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:00,889 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2018-02-04 02:49:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:49:00,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 02:49:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:00,890 INFO L225 Difference]: With dead ends: 234 [2018-02-04 02:49:00,890 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 02:49:00,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:49:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 02:49:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-02-04 02:49:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 02:49:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-02-04 02:49:00,893 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-02-04 02:49:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:00,893 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-02-04 02:49:00,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:49:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-02-04 02:49:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 02:49:00,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:00,894 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] [2018-02-04 02:49:00,895 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-02-04 02:49:00,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:00,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:00,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:00,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:49:00,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:00,931 INFO 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 02:49:00,931 INFO L182 omatonBuilderFactory]: Interpolants [3096#true, 3097#false, 3098#(= 1 (select |#valid| main_~x~0.base)), 3099#(= 1 (select |#valid| main_~first~0.base))] [2018-02-04 02:49:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:00,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:49:00,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:49:00,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:49:00,932 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-02-04 02:49:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,078 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2018-02-04 02:49:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:49:01,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-04 02:49:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,080 INFO L225 Difference]: With dead ends: 160 [2018-02-04 02:49:01,080 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 02:49:01,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:49:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 02:49:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-02-04 02:49:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 02:49:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-02-04 02:49:01,083 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-02-04 02:49:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,084 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-02-04 02:49:01,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:49:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-02-04 02:49:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 02:49:01,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,085 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] [2018-02-04 02:49:01,085 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-02-04 02:49:01,086 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:01,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:49:01,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,136 INFO L182 omatonBuilderFactory]: Interpolants [3396#true, 3397#false, 3398#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 3399#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3400#(and (= main_~first~0.offset 0) (= (select |#length| main_~first~0.base) 20))] [2018-02-04 02:49:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:49:01,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:49:01,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:49:01,137 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-02-04 02:49:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,308 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2018-02-04 02:49:01,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:49:01,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-04 02:49:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,309 INFO L225 Difference]: With dead ends: 212 [2018-02-04 02:49:01,309 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 02:49:01,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 02:49:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 02:49:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-02-04 02:49:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 02:49:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-02-04 02:49:01,313 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-02-04 02:49:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,314 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-02-04 02:49:01,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:49:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-02-04 02:49:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:49:01,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,315 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] [2018-02-04 02:49:01,315 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,315 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-02-04 02:49:01,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:49:01,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-04 02:49:01,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:01,356 INFO 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 02:49:01,357 INFO L182 omatonBuilderFactory]: Interpolants [3781#true, 3782#false, 3783#(= main_~c1~0 0), 3784#(<= 1 main_~c1~0)] [2018-02-04 02:49:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:49:01,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:49:01,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:49:01,357 INFO L87 Difference]: Start difference. First operand 162 states and 189 transitions. Second operand 4 states. [2018-02-04 02:49:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,372 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-04 02:49:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:49:01,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-02-04 02:49:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,374 INFO L225 Difference]: With dead ends: 162 [2018-02-04 02:49:01,374 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 02:49:01,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:49:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 02:49:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-04 02:49:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 02:49:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-02-04 02:49:01,377 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 33 [2018-02-04 02:49:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,378 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-02-04 02:49:01,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:49:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-02-04 02:49:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:49:01,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,379 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] [2018-02-04 02:49:01,379 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361569, now seen corresponding path program 1 times [2018-02-04 02:49:01,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:49:01,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:01,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:49:01,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,405 INFO L182 omatonBuilderFactory]: Interpolants [4112#(= 1 (select |#valid| main_~x~1.base)), 4109#true, 4110#false, 4111#(= main_~x~1.base main_~first~0.base)] [2018-02-04 02:49:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:49:01,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:49:01,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:49:01,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:49:01,406 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-02-04 02:49:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,462 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-04 02:49:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:49:01,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 02:49:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,465 INFO L225 Difference]: With dead ends: 176 [2018-02-04 02:49:01,465 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 02:49:01,465 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 02:49:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 02:49:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 168. [2018-02-04 02:49:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 02:49:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2018-02-04 02:49:01,468 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 34 [2018-02-04 02:49:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,468 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2018-02-04 02:49:01,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:49:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2018-02-04 02:49:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:49:01,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,469 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] [2018-02-04 02:49:01,469 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1433361568, now seen corresponding path program 1 times [2018-02-04 02:49:01,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:01,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:49:01,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:01,527 INFO 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 02:49:01,527 INFO L182 omatonBuilderFactory]: Interpolants [4464#(and (= (select |#length| main_~x~1.base) 20) (= main_~x~1.offset 0)), 4459#true, 4460#false, 4461#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 4462#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 4463#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))] [2018-02-04 02:49:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:49:01,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:49:01,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:49:01,528 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand 6 states. [2018-02-04 02:49:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,671 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2018-02-04 02:49:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:49:01,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 02:49:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,672 INFO L225 Difference]: With dead ends: 250 [2018-02-04 02:49:01,672 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 02:49:01,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:49:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 02:49:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2018-02-04 02:49:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 02:49:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2018-02-04 02:49:01,675 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2018-02-04 02:49:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,675 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2018-02-04 02:49:01,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:49:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2018-02-04 02:49:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:49:01,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,676 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:01,676 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -521175964, now seen corresponding path program 1 times [2018-02-04 02:49:01,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:01,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:49:01,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:01,734 INFO 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 02:49:01,734 INFO L182 omatonBuilderFactory]: Interpolants [4912#false, 4913#(= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)), 4914#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 4915#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 4916#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 4917#(= 1 (select |#valid| |main_#t~mem24.base|)), 4918#(= 1 (select |#valid| main_~y~1.base)), 4911#true] [2018-02-04 02:49:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:01,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:49:01,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:49:01,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:49:01,734 INFO L87 Difference]: Start difference. First operand 186 states and 233 transitions. Second operand 8 states. [2018-02-04 02:49:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:01,945 INFO L93 Difference]: Finished difference Result 268 states and 332 transitions. [2018-02-04 02:49:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:49:01,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 02:49:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:01,947 INFO L225 Difference]: With dead ends: 268 [2018-02-04 02:49:01,947 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 02:49:01,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:49:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 02:49:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 199. [2018-02-04 02:49:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 02:49:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2018-02-04 02:49:01,953 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2018-02-04 02:49:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:01,953 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2018-02-04 02:49:01,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:49:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2018-02-04 02:49:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:49:01,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:01,954 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:01,954 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash -521175963, now seen corresponding path program 1 times [2018-02-04 02:49:01,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:01,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:49:02,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:49:02,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:02,051 INFO 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 02:49:02,051 INFO L182 omatonBuilderFactory]: Interpolants [5401#true, 5402#false, 5403#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset)), 5404#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 5405#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 5406#(and (= main_~x~1.base |main_#t~mem24.base|) (= main_~x~1.offset |main_#t~mem24.offset|)), 5407#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-02-04 02:49:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:49:02,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:49:02,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:49:02,052 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand 7 states. [2018-02-04 02:49:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:02,216 INFO L93 Difference]: Finished difference Result 257 states and 318 transitions. [2018-02-04 02:49:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:49:02,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 02:49:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:02,217 INFO L225 Difference]: With dead ends: 257 [2018-02-04 02:49:02,217 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 02:49:02,217 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:49:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 02:49:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 198. [2018-02-04 02:49:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 02:49:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2018-02-04 02:49:02,220 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 38 [2018-02-04 02:49:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:02,220 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2018-02-04 02:49:02,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:49:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2018-02-04 02:49:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 02:49:02,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:02,221 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:02,221 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -47566885, now seen corresponding path program 1 times [2018-02-04 02:49:02,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:02,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:49:02,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 02:49:02,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:02,287 INFO 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 02:49:02,287 INFO L182 omatonBuilderFactory]: Interpolants [5876#true, 5877#false, 5878#(= main_~c1~0 0), 5879#(<= main_~c1~0 1), 5880#(<= main_~c1~0 0)] [2018-02-04 02:49:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:49:02,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:49:02,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:49:02,288 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand 5 states. [2018-02-04 02:49:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:02,310 INFO L93 Difference]: Finished difference Result 253 states and 312 transitions. [2018-02-04 02:49:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:49:02,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 02:49:02,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:02,311 INFO L225 Difference]: With dead ends: 253 [2018-02-04 02:49:02,311 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 02:49:02,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:49:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 02:49:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2018-02-04 02:49:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 02:49:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 310 transitions. [2018-02-04 02:49:02,315 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 310 transitions. Word has length 41 [2018-02-04 02:49:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:02,315 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 310 transitions. [2018-02-04 02:49:02,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:49:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 310 transitions. [2018-02-04 02:49:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:49:02,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:02,316 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:02,316 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:02,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1474573890, now seen corresponding path program 1 times [2018-02-04 02:49:02,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:02,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:49:02,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:49:02,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:02,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 02:49:02,410 INFO L182 omatonBuilderFactory]: Interpolants [6372#true, 6373#false, 6374#(= |#valid| |old(#valid)|), 6375#(and (= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0)) (not (= 0 |main_#t~malloc3.base|))), 6376#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 6377#(and (not (= 0 main_~first~0.base)) (= (store |#valid| main_~first~0.base 0) |old(#valid)|)), 6378#(and (= |old(#valid)| (store |#valid| main_~x~1.base 0)) (not (= 0 main_~x~1.base)))] [2018-02-04 02:49:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:49:02,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:49:02,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:49:02,411 INFO L87 Difference]: Start difference. First operand 238 states and 310 transitions. Second operand 7 states. [2018-02-04 02:49:02,628 WARN L143 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-04 02:49:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:02,703 INFO L93 Difference]: Finished difference Result 243 states and 314 transitions. [2018-02-04 02:49:02,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:49:02,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-02-04 02:49:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:02,704 INFO L225 Difference]: With dead ends: 243 [2018-02-04 02:49:02,704 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 02:49:02,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:49:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 02:49:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-02-04 02:49:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 02:49:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 300 transitions. [2018-02-04 02:49:02,706 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 300 transitions. Word has length 42 [2018-02-04 02:49:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:02,707 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 300 transitions. [2018-02-04 02:49:02,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:49:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 300 transitions. [2018-02-04 02:49:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:49:02,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:02,707 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:02,707 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash 924240911, now seen corresponding path program 1 times [2018-02-04 02:49:02,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:02,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:49:02,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:49:02,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,773 INFO L182 omatonBuilderFactory]: Interpolants [6864#(= 1 (select |#valid| main_~last~0.base)), 6865#(or (= main_~last~0.base |main_#t~malloc3.base|) (= 1 (select |#valid| main_~last~0.base))), 6866#(or (= main_~last~0.base main_~x~0.base) (= 1 (select |#valid| main_~last~0.base))), 6867#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~last~0.base))), 6861#true, 6862#false, 6863#(= 1 (select |#valid| main_~x~0.base))] [2018-02-04 02:49:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:02,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:49:02,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:49:02,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:49:02,774 INFO L87 Difference]: Start difference. First operand 229 states and 300 transitions. Second operand 7 states. [2018-02-04 02:49:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:02,883 INFO L93 Difference]: Finished difference Result 252 states and 325 transitions. [2018-02-04 02:49:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:49:02,883 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-02-04 02:49:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:02,885 INFO L225 Difference]: With dead ends: 252 [2018-02-04 02:49:02,885 INFO L226 Difference]: Without dead ends: 252 [2018-02-04 02:49:02,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:49:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-04 02:49:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 228. [2018-02-04 02:49:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 02:49:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2018-02-04 02:49:02,889 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 45 [2018-02-04 02:49:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:02,890 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2018-02-04 02:49:02,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:49:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2018-02-04 02:49:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 02:49:02,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:02,891 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:02,891 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash 924240912, now seen corresponding path program 1 times [2018-02-04 02:49:02,891 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:49:02,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:49:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:03,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:49:03,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:49:03,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:49:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:03,013 INFO L182 omatonBuilderFactory]: Interpolants [7348#true, 7349#false, 7350#(and (= 20 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 7351#(and (= (select |#length| main_~x~0.base) 20) (= 0 main_~x~0.offset)), 7352#(and (= (select |#length| main_~x~0.base) 20) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 7353#(and (<= 20 (select |#length| main_~last~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 7354#(and (<= 20 (select |#length| main_~last~0.base)) (= main_~last~0.offset 0))] [2018-02-04 02:49:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:49:03,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:49:03,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:49:03,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:49:03,014 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand 7 states. [2018-02-04 02:49:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:49:03,258 INFO L93 Difference]: Finished difference Result 317 states and 402 transitions. [2018-02-04 02:49:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:49:03,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-02-04 02:49:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:49:03,261 INFO L225 Difference]: With dead ends: 317 [2018-02-04 02:49:03,261 INFO L226 Difference]: Without dead ends: 317 [2018-02-04 02:49:03,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:49:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-02-04 02:49:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 227. [2018-02-04 02:49:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 02:49:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 296 transitions. [2018-02-04 02:49:03,266 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 296 transitions. Word has length 45 [2018-02-04 02:49:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:49:03,266 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 296 transitions. [2018-02-04 02:49:03,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:49:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 296 transitions. [2018-02-04 02:49:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 02:49:03,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:49:03,267 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:49:03,267 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-04 02:49:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2048623147, now seen corresponding path program 1 times [2018-02-04 02:49:03,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:49:03,276 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-04 02:49:03,276 INFO L293 seRefinementStrategy]: Strategy FixedTraceAbstractionRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-02-04 02:49:03,276 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:49:03,289 WARN L188 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-02-04 02:49:03,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:49:03 BoogieIcfgContainer [2018-02-04 02:49:03,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:49:03,290 INFO L168 Benchmark]: Toolchain (without parser) took 5268.82 ms. Allocated memory was 395.3 MB in the beginning and 720.4 MB in the end (delta: 325.1 MB). Free memory was 352.0 MB in the beginning and 597.5 MB in the end (delta: -245.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:49:03,291 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:49:03,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.14 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 341.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:49:03,292 INFO L168 Benchmark]: Boogie Preprocessor took 31.73 ms. Allocated memory is still 395.3 MB. Free memory was 341.4 MB in the beginning and 338.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:49:03,292 INFO L168 Benchmark]: RCFGBuilder took 359.45 ms. Allocated memory is still 395.3 MB. Free memory was 338.8 MB in the beginning and 306.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:49:03,292 INFO L168 Benchmark]: TraceAbstraction took 4709.40 ms. Allocated memory was 395.3 MB in the beginning and 720.4 MB in the end (delta: 325.1 MB). Free memory was 306.9 MB in the beginning and 597.5 MB in the end (delta: -290.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:49:03,293 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 165.14 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 341.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.73 ms. Allocated memory is still 395.3 MB. Free memory was 341.4 MB in the beginning and 338.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 359.45 ms. Allocated memory is still 395.3 MB. Free memory was 338.8 MB in the beginning and 306.9 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4709.40 ms. Allocated memory was 395.3 MB in the beginning and 720.4 MB in the end (delta: 325.1 MB). Free memory was 306.9 MB in the beginning and 597.5 MB in the end (delta: -290.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L631] struct T2* first = ((void *)0); [L632] struct T2* last = ((void *)0); [L633] int c1 = 0; [L634] int c2 = 0; [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] c1 < 5 && __VERIFIER_nondet_int() [L635] COND TRUE c1 < 5 && __VERIFIER_nondet_int() [L636] c1++ [L637] EXPR, FCALL malloc(sizeof(struct T2)) [L637] struct T2* x = malloc(sizeof(struct T2)); [L638] COND FALSE !(!x) [L640] FCALL x->next = ((void *)0) [L641] FCALL x->prev = ((void *)0) [L642] FCALL x->head.next = &x->head [L643] FCALL x->head.prev = &x->head [L644] FCALL x->head.data = c1 * 2 [L645] struct T* y = ((void *)0); [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y [L653] FCALL y->prev = &x->head [L654] FCALL y->data = c2*c1 [L655] FCALL x->head.next = y [L656] y = ((void *)0) [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] c2 < 3 && __VERIFIER_nondet_int() [L646] COND TRUE c2 < 3 && __VERIFIER_nondet_int() [L647] c2++ [L648] EXPR, FCALL malloc(sizeof(struct T)) [L648] y = malloc(sizeof(struct T)) [L649] COND FALSE !(!y) [L651] EXPR, FCALL x->head.next [L651] FCALL y->next = x->head.next [L652] EXPR, FCALL y->next [L652] FCALL y->next->prev = y - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 41 error locations. UNKNOWN Result, 4.6s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1705 SDtfs, 2663 SDslu, 3261 SDs, 0 SdLazy, 2480 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 44 SyntacticMatches, 14 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 41/79 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 883 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 628 ConstructedInterpolants, 0 QuantifiedInterpolants, 118715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 41/79 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/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-49-03-299.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-49-03-299.csv Received shutdown request...