java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:48:15,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:48:15,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:48:15,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:48:15,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:48:15,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:48:15,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:48:15,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:48:15,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:48:15,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:48:15,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:48:15,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:48:15,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:48:15,519 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:48:15,520 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:48:15,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:48:15,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:48:15,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:48:15,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:48:15,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:48:15,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:48:15,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:48:15,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:48:15,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:48:15,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:48:15,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:48:15,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:48:15,531 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:48:15,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:48:15,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:48:15,532 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:48:15,532 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:48:15,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:48:15,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:48:15,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:48:15,542 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:48:15,542 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:48:15,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:48:15,543 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:48:15,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:48:15,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:48:15,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:48:15,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:48:15,582 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:48:15,585 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:48:15,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:48:15,586 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:48:15,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:48:15,694 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:48:15,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:48:15,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:48:15,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:48:15,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:48:15,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15, skipping insertion in model container [2018-02-02 09:48:15,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,713 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:48:15,740 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:48:15,826 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:48:15,843 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:48:15,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15 WrapperNode [2018-02-02 09:48:15,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:48:15,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:48:15,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:48:15,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:48:15,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... [2018-02-02 09:48:15,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:48:15,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:48:15,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:48:15,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:48:15,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:48:15,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:48:15,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:48:15,917 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-02-02 09:48:15,917 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:48:15,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:48:16,120 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:48:16,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:16 BoogieIcfgContainer [2018-02-02 09:48:16,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:48:16,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:48:16,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:48:16,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:48:16,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:48:15" (1/3) ... [2018-02-02 09:48:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d43d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:16, skipping insertion in model container [2018-02-02 09:48:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:15" (2/3) ... [2018-02-02 09:48:16,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d43d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:16, skipping insertion in model container [2018-02-02 09:48:16,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:16" (3/3) ... [2018-02-02 09:48:16,125 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:48:16,132 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:48:16,137 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 09:48:16,161 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:48:16,162 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:48:16,162 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:48:16,162 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:48:16,162 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:48:16,162 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:48:16,162 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:48:16,162 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:48:16,163 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:48:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-02 09:48:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:48:16,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,179 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,180 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 380982983, now seen corresponding path program 1 times [2018-02-02 09:48:16,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:16,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:16,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,344 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| main_~nondetString1~0.base)), 61#true, 62#false, 63#(= 1 (select |#valid| |main_#t~malloc10.base|))] [2018-02-02 09:48:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:48:16,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:48:16,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:48:16,409 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-02 09:48:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:16,509 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-02 09:48:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:48:16,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:48:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:16,517 INFO L225 Difference]: With dead ends: 57 [2018-02-02 09:48:16,518 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 09:48:16,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:48:16,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 09:48:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 09:48:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 09:48:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 09:48:16,546 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-02 09:48:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:16,546 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 09:48:16,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:48:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 09:48:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:48:16,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,547 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,547 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash 380982984, now seen corresponding path program 1 times [2018-02-02 09:48:16,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:16,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:48:16,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,646 INFO L182 omatonBuilderFactory]: Interpolants [178#true, 179#false, 180#(<= 1 main_~length1~0), 181#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 182#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 183#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:48:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:16,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:16,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:16,648 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-02 09:48:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:16,698 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-02 09:48:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:16,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:48:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:16,699 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:48:16,699 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 09:48:16,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:48:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 09:48:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 09:48:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:48:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-02 09:48:16,704 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-02 09:48:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:16,705 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-02 09:48:16,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-02 09:48:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:48:16,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,705 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429420, now seen corresponding path program 1 times [2018-02-02 09:48:16,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:16,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:16,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,743 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= 1 (select |#valid| |main_#t~malloc11.base|)), 295#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:48:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:48:16,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:48:16,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:48:16,744 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-02 09:48:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:16,787 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-02 09:48:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:48:16,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:48:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:16,789 INFO L225 Difference]: With dead ends: 52 [2018-02-02 09:48:16,789 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 09:48:16,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:48:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 09:48:16,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 09:48:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:48:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-02 09:48:16,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-02 09:48:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:16,794 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-02 09:48:16,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:48:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-02 09:48:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:48:16,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,795 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,795 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429419, now seen corresponding path program 1 times [2018-02-02 09:48:16,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:16,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:48:16,851 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,851 INFO L182 omatonBuilderFactory]: Interpolants [402#true, 403#false, 404#(<= 1 main_~length2~0), 405#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 406#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:48:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:48:16,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:48:16,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:48:16,852 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-02 09:48:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:16,876 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-02 09:48:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:16,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:48:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:16,877 INFO L225 Difference]: With dead ends: 51 [2018-02-02 09:48:16,878 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 09:48:16,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 09:48:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 09:48:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:48:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-02 09:48:16,882 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-02 09:48:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:16,882 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-02 09:48:16,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:48:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-02 09:48:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:48:16,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,883 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,883 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash -425895657, now seen corresponding path program 1 times [2018-02-02 09:48:16,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:16,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:48:16,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,922 INFO L182 omatonBuilderFactory]: Interpolants [512#false, 513#(= 1 (select |#valid| main_~nondetString1~0.base)), 514#(= 1 (select |#valid| |cstrspn_#in~s1.base|)), 515#(= 1 (select |#valid| cstrspn_~sc1~0.base)), 511#true] [2018-02-02 09:48:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:16,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:48:16,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:48:16,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:48:16,923 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-02 09:48:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:16,973 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-02 09:48:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:48:16,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 09:48:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:16,974 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:48:16,974 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:48:16,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:48:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 09:48:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:48:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-02 09:48:16,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-02-02 09:48:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:16,978 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-02 09:48:16,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:48:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-02 09:48:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:48:16,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:16,979 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:16,979 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash -425895656, now seen corresponding path program 1 times [2018-02-02 09:48:16,980 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:16,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:17,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:48:17,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,057 INFO L182 omatonBuilderFactory]: Interpolants [616#true, 617#false, 618#(<= 1 main_~length1~0), 619#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0)), 620#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 621#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 622#(and (<= 1 (select |#length| |cstrspn_#in~s1.base|)) (= 0 |cstrspn_#in~s1.offset|)), 623#(and (= cstrspn_~sc1~0.offset 0) (<= 1 (select |#length| cstrspn_~sc1~0.base)))] [2018-02-02 09:48:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:48:17,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:48:17,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:17,058 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-02-02 09:48:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:17,173 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-02-02 09:48:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:48:17,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-02 09:48:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:17,175 INFO L225 Difference]: With dead ends: 73 [2018-02-02 09:48:17,175 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:48:17,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:48:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:48:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-02-02 09:48:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:48:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-02 09:48:17,178 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-02-02 09:48:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:17,178 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-02 09:48:17,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:48:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-02 09:48:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:17,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:17,179 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] [2018-02-02 09:48:17,179 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031168, now seen corresponding path program 1 times [2018-02-02 09:48:17,180 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:17,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:17,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:48:17,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,219 INFO L182 omatonBuilderFactory]: Interpolants [758#true, 759#false, 760#(= 1 (select |#valid| main_~nondetString2~0.base)), 761#(= 1 (select |#valid| |cstrspn_#in~s2.base|)), 762#(= 1 (select |#valid| cstrspn_~s2.base)), 763#(= 1 (select |#valid| cstrspn_~s~0.base))] [2018-02-02 09:48:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:17,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:17,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:17,220 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-02-02 09:48:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:17,279 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-02 09:48:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:48:17,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:48:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:17,281 INFO L225 Difference]: With dead ends: 53 [2018-02-02 09:48:17,281 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 09:48:17,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 09:48:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-02-02 09:48:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:48:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-02 09:48:17,285 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-02-02 09:48:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-02 09:48:17,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-02 09:48:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:48:17,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:17,285 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] [2018-02-02 09:48:17,285 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031167, now seen corresponding path program 1 times [2018-02-02 09:48:17,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:17,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:17,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:48:17,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,372 INFO L182 omatonBuilderFactory]: Interpolants [871#true, 872#false, 873#(<= 1 main_~length2~0), 874#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 875#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 876#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 877#(and (<= 1 (select |#length| |cstrspn_#in~s2.base|)) (= 0 |cstrspn_#in~s2.offset|)), 878#(and (= 0 cstrspn_~s2.offset) (<= 1 (select |#length| cstrspn_~s2.base))), 879#(and (<= 1 (select |#length| cstrspn_~s~0.base)) (= cstrspn_~s~0.offset 0))] [2018-02-02 09:48:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:48:17,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:48:17,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:48:17,374 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-02-02 09:48:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:17,499 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-02-02 09:48:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:48:17,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 09:48:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:17,500 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:48:17,500 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:48:17,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:48:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:48:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-02 09:48:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 09:48:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-02 09:48:17,504 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-02-02 09:48:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:17,504 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-02 09:48:17,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:48:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-02 09:48:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:48:17,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:17,505 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:17,505 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1785224664, now seen corresponding path program 1 times [2018-02-02 09:48:17,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:17,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:17,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:48:17,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,553 INFO L182 omatonBuilderFactory]: Interpolants [1011#true, 1012#false, 1013#(not |cstrspn_#t~short5|)] [2018-02-02 09:48:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:48:17,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:48:17,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:48:17,553 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-02-02 09:48:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:17,558 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-02-02 09:48:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:48:17,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 09:48:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:17,558 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:48:17,558 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:48:17,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:48:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:48:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 09:48:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:48:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-02-02 09:48:17,562 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-02-02 09:48:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:17,562 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-02-02 09:48:17,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:48:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-02-02 09:48:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:48:17,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:17,563 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:17,563 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash -419708018, now seen corresponding path program 1 times [2018-02-02 09:48:17,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:17,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:17,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:48:17,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,630 INFO L182 omatonBuilderFactory]: Interpolants [1136#(= |#valid| |old(#valid)|), 1137#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1138#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 1139#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)), 1134#true, 1135#false] [2018-02-02 09:48:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:48:17,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:48:17,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:48:17,630 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 6 states. [2018-02-02 09:48:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:17,710 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-02-02 09:48:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:48:17,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-02 09:48:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:17,712 INFO L225 Difference]: With dead ends: 59 [2018-02-02 09:48:17,712 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 09:48:17,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:48:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 09:48:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 09:48:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 09:48:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-02 09:48:17,715 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-02-02 09:48:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:17,716 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-02 09:48:17,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:48:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-02 09:48:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:48:17,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:17,717 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:17,717 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2090509973, now seen corresponding path program 1 times [2018-02-02 09:48:17,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:17,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:17,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:17,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:17,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-02 09:48:17,931 INFO L182 omatonBuilderFactory]: Interpolants [1253#true, 1254#false, 1255#(<= 1 main_~length2~0), 1256#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 1257#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 1) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 1258#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1259#(and (or (<= 2 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) |cstrspn_#in~s2.offset|))) (= 0 |cstrspn_#in~s2.offset|)), 1260#(and (= 0 cstrspn_~s2.offset) (or (<= 2 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset)))), 1261#(and (or (<= 2 (select |#length| cstrspn_~s~0.base)) (= 0 (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset))) (= cstrspn_~s~0.offset 0)), 1262#(and (or (<= 2 (select |#length| cstrspn_~s~0.base)) (= |cstrspn_#t~mem3| 0)) (= cstrspn_~s~0.offset 0)), 1263#(and (= cstrspn_~s~0.offset 0) (or (<= 2 (select |#length| cstrspn_~s~0.base)) (not |cstrspn_#t~short5|))), 1264#(and (<= 2 (select |#length| cstrspn_~s~0.base)) (= cstrspn_~s~0.offset 0)), 1265#(and (<= (+ cstrspn_~s~0.offset 1) (select |#length| cstrspn_~s~0.base)) (<= 1 cstrspn_~s~0.offset))] [2018-02-02 09:48:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:17,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:17,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:17,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:17,932 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 13 states. [2018-02-02 09:48:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:18,182 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-02 09:48:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:48:18,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 09:48:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:18,187 INFO L225 Difference]: With dead ends: 78 [2018-02-02 09:48:18,188 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 09:48:18,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:48:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 09:48:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-02-02 09:48:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:48:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-02-02 09:48:18,192 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 30 [2018-02-02 09:48:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:18,193 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-02-02 09:48:18,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-02-02 09:48:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:48:18,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:18,194 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:18,194 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:18,194 INFO L82 PathProgramCache]: Analyzing trace with hash 917827763, now seen corresponding path program 1 times [2018-02-02 09:48:18,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:18,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:18,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:48:18,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,261 INFO L182 omatonBuilderFactory]: Interpolants [1424#(or (not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset))) |cstrspn_#t~short5|), 1425#(not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset))), 1426#(not (= cstrspn_~c~0 |cstrspn_#t~mem7|)), 1417#true, 1418#false, 1419#(= |cstrspn_#t~mem1| (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset)), 1420#(not (= (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset) 0)), 1421#(not (= |cstrspn_#t~mem2| 0)), 1422#(not (= cstrspn_~c~0 0)), 1423#(and (not (= cstrspn_~c~0 0)) (= |cstrspn_#t~mem3| (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset)))] [2018-02-02 09:48:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:48:18,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:48:18,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:48:18,262 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 10 states. [2018-02-02 09:48:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:18,376 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-02-02 09:48:18,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:48:18,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 09:48:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:18,377 INFO L225 Difference]: With dead ends: 62 [2018-02-02 09:48:18,377 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 09:48:18,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:48:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 09:48:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-02-02 09:48:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:48:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-02-02 09:48:18,379 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 31 [2018-02-02 09:48:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:18,379 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-02-02 09:48:18,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:48:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-02-02 09:48:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:48:18,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:18,379 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:18,380 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1391047024, now seen corresponding path program 1 times [2018-02-02 09:48:18,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:18,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:48:18,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:48:18,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,519 INFO L182 omatonBuilderFactory]: Interpolants [1568#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1569#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1570#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1571#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1572#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)), 1573#(= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset)), 1574#(= |cstrspn_#t~mem1| 0), 1564#true, 1565#false, 1566#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1567#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-02 09:48:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:48:18,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:48:18,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:48:18,520 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 11 states. [2018-02-02 09:48:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:18,634 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-02-02 09:48:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:48:18,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-02 09:48:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:18,635 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:48:18,635 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 09:48:18,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:48:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 09:48:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 09:48:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:48:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-02-02 09:48:18,637 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 33 [2018-02-02 09:48:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:18,638 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-02-02 09:48:18,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:48:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-02-02 09:48:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:48:18,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:18,639 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:18,639 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash 532181010, now seen corresponding path program 1 times [2018-02-02 09:48:18,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:18,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:18,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:18,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,882 INFO L182 omatonBuilderFactory]: Interpolants [1713#true, 1714#false, 1715#(<= 1 main_~length1~0), 1716#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1717#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 1718#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1719#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1720#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 1721#(and (or (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) |cstrspn_#in~s1.offset|)) (<= 2 (select |#length| |cstrspn_#in~s1.base|))) (= 0 |cstrspn_#in~s1.offset|)), 1722#(and (= cstrspn_~sc1~0.offset 0) (or (= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset)) (<= 2 (select |#length| cstrspn_~sc1~0.base)))), 1723#(and (or (= |cstrspn_#t~mem1| 0) (<= 2 (select |#length| cstrspn_~sc1~0.base))) (= cstrspn_~sc1~0.offset 0)), 1724#(and (= cstrspn_~sc1~0.offset 0) (<= 2 (select |#length| cstrspn_~sc1~0.base))), 1725#(and (<= 1 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 1) (select |#length| cstrspn_~sc1~0.base)))] [2018-02-02 09:48:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:18,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:18,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:18,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:18,883 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2018-02-02 09:48:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:19,161 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-02 09:48:19,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:48:19,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-02-02 09:48:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:19,162 INFO L225 Difference]: With dead ends: 123 [2018-02-02 09:48:19,162 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 09:48:19,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:48:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 09:48:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2018-02-02 09:48:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:48:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-02-02 09:48:19,165 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 33 [2018-02-02 09:48:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:19,166 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-02-02 09:48:19,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-02-02 09:48:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:48:19,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:19,167 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:19,167 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash -360199549, now seen corresponding path program 1 times [2018-02-02 09:48:19,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:19,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:19,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:19,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:19,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:19,415 INFO L182 omatonBuilderFactory]: Interpolants [1952#true, 1953#false, 1954#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 1955#(and (= 0 main_~nondetString2~0.offset) (or (= main_~length2~0 (select |#length| main_~nondetString2~0.base)) (= 2 (+ main_~nondetString2~0.offset main_~length2~0)))), 1956#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 1957#(and (or (<= 3 (select |#length| |cstrspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) 1)) (<= (select |#length| |cstrspn_#in~s2.base|) 1)) (= 0 |cstrspn_#in~s2.offset|)), 1958#(and (= 0 cstrspn_~s2.offset) (or (<= 3 (select |#length| cstrspn_~s2.base)) (= 0 (select (select |#memory_int| cstrspn_~s2.base) 1)) (<= (select |#length| cstrspn_~s2.base) 1))), 1959#(and (or (<= 3 (select |#length| cstrspn_~s~0.base)) (<= (select |#length| cstrspn_~s~0.base) 1) (= 0 (select (select |#memory_int| cstrspn_~s~0.base) 1))) (= cstrspn_~s~0.offset 0)), 1960#(or (and (<= 1 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base))) (<= (select |#length| cstrspn_~s~0.base) cstrspn_~s~0.offset) (and (= 0 (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset)) (= 1 cstrspn_~s~0.offset))), 1961#(or (and (<= 1 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base))) (and (= 1 cstrspn_~s~0.offset) (= |cstrspn_#t~mem3| 0))), 1962#(or (and (<= 1 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base))) (not |cstrspn_#t~short5|)), 1963#(and (<= 1 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base))), 1964#(and (<= (+ cstrspn_~s~0.offset 1) (select |#length| cstrspn_~s~0.base)) (<= 2 cstrspn_~s~0.offset))] [2018-02-02 09:48:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:19,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:19,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:19,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:19,416 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 13 states. [2018-02-02 09:48:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:19,909 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-02-02 09:48:19,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:48:19,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 09:48:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:19,911 INFO L225 Difference]: With dead ends: 140 [2018-02-02 09:48:19,911 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:48:19,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:48:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:48:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2018-02-02 09:48:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 09:48:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-02 09:48:19,918 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 37 [2018-02-02 09:48:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:19,918 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-02 09:48:19,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:19,918 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-02 09:48:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:48:19,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:19,919 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:19,919 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1858150935, now seen corresponding path program 2 times [2018-02-02 09:48:19,920 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:19,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:48:20,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:20,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:20,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:20,118 INFO L182 omatonBuilderFactory]: Interpolants [2240#(and (<= (+ cstrspn_~s~0.offset 1) (select |#length| cstrspn_~s~0.base)) (<= 1 cstrspn_~s~0.offset)), 2228#true, 2229#false, 2230#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2231#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2232#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2233#(= 0 (select (select |#memory_int| |cstrspn_#in~s2.base|) (+ (select |#length| |cstrspn_#in~s2.base|) (- 1)))), 2234#(= 0 (select (select |#memory_int| cstrspn_~s2.base) (+ (select |#length| cstrspn_~s2.base) (- 1)))), 2235#(= 0 (select (select |#memory_int| cstrspn_~s~0.base) (+ (select |#length| cstrspn_~s~0.base) (- 1)))), 2236#(or (<= (select |#length| cstrspn_~s~0.base) cstrspn_~s~0.offset) (= 0 (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset)) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base))), 2237#(or (= |cstrspn_#t~mem3| 0) (and (<= 0 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base)))), 2238#(or (not |cstrspn_#t~short5|) (and (<= 0 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base)))), 2239#(and (<= 0 cstrspn_~s~0.offset) (<= (+ cstrspn_~s~0.offset 2) (select |#length| cstrspn_~s~0.base)))] [2018-02-02 09:48:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:48:20,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:20,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:20,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:20,119 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 13 states. [2018-02-02 09:48:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:20,360 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-02-02 09:48:20,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:48:20,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-02-02 09:48:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:20,361 INFO L225 Difference]: With dead ends: 111 [2018-02-02 09:48:20,361 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:48:20,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:48:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:48:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 52. [2018-02-02 09:48:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 09:48:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-02 09:48:20,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 44 [2018-02-02 09:48:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:20,363 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-02 09:48:20,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-02 09:48:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 09:48:20,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:20,364 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:20,364 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1944116138, now seen corresponding path program 2 times [2018-02-02 09:48:20,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:20,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:20,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:20,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:48:20,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:20,674 INFO L182 omatonBuilderFactory]: Interpolants [2432#(and (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= main_~nondetString1~0.offset 0)), 2433#(and (or (<= (select |#length| |cstrspn_#in~s1.base|) 1) (<= 3 (select |#length| |cstrspn_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) 1))) (= 0 |cstrspn_#in~s1.offset|)), 2434#(and (= cstrspn_~sc1~0.offset 0) (or (<= (select |#length| cstrspn_~sc1~0.base) 1) (<= 3 (select |#length| cstrspn_~sc1~0.base)) (= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) 1)))), 2435#(and (= cstrspn_~sc1~0.offset 1) (or (= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset)) (<= (select |#length| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2436#(and (or (= |cstrspn_#t~mem1| 0) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base))) (= cstrspn_~sc1~0.offset 1)), 2437#(and (= cstrspn_~sc1~0.offset 1) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base))), 2438#(and (<= (+ cstrspn_~sc1~0.offset 1) (select |#length| cstrspn_~sc1~0.base)) (<= 2 cstrspn_~sc1~0.offset)), 2426#true, 2427#false, 2428#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2429#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2430#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0)), 2431#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (or (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (not (= 2 (+ main_~nondetString1~0.offset main_~length1~0)))) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:48:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:20,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:48:20,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:48:20,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:48:20,675 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 13 states. [2018-02-02 09:48:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:20,977 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-02-02 09:48:20,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:48:20,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 09:48:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:20,978 INFO L225 Difference]: With dead ends: 78 [2018-02-02 09:48:20,978 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 09:48:20,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:48:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 09:48:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-02-02 09:48:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 09:48:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-02-02 09:48:20,981 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 48 [2018-02-02 09:48:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:20,981 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-02-02 09:48:20,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:48:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-02-02 09:48:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:48:20,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:48:20,982 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:48:20,982 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-02-02 09:48:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2118590574, now seen corresponding path program 3 times [2018-02-02 09:48:20,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:48:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:48:20,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:48:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:48:21,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:48:21,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 09:48:21,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:48:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:48:21,310 INFO L182 omatonBuilderFactory]: Interpolants [2624#(and (<= 1 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 1) (select |#length| cstrspn_~sc1~0.base))), 2602#true, 2603#false, 2604#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2605#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2606#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2607#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2608#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2609#(= 0 (select (select |#memory_int| |cstrspn_#in~s1.base|) (+ (select |#length| |cstrspn_#in~s1.base|) (- 1)))), 2610#(= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1)))), 2611#(and (= |cstrspn_#t~mem1| (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1))))), 2612#(and (= cstrspn_~s~0.base cstrspn_~s2.base) (= cstrspn_~s~0.offset cstrspn_~s2.offset) (not (= (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset) (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1)))))), 2613#(and (not (= |cstrspn_#t~mem2| (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1))))) (= cstrspn_~s~0.base cstrspn_~s2.base) (= cstrspn_~s~0.offset cstrspn_~s2.offset)), 2614#(and (= cstrspn_~s~0.base cstrspn_~s2.base) (= cstrspn_~s~0.offset cstrspn_~s2.offset) (not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1)))))), 2615#(and (not (= cstrspn_~c~0 (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1))))) (= (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset) |cstrspn_#t~mem7|)), 2616#(not (= (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset) (select (select |#memory_int| cstrspn_~sc1~0.base) (+ (select |#length| cstrspn_~sc1~0.base) (- 1))))), 2617#(or (not (= (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset) (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset))) (<= (select |#length| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base))), 2618#(or (not (= (select (select |#memory_int| cstrspn_~s2.base) cstrspn_~s2.offset) (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset))) (and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2619#(or (not (= (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset) (select (select |#memory_int| cstrspn_~sc1~0.base) cstrspn_~sc1~0.offset))) (and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2620#(or (not (= (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset) |cstrspn_#t~mem2|)) (and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2621#(or (not (= (select (select |#memory_int| cstrspn_~s~0.base) cstrspn_~s~0.offset) cstrspn_~c~0)) (and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2622#(or (not (= |cstrspn_#t~mem7| cstrspn_~c~0)) (and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))), 2623#(and (<= 0 cstrspn_~sc1~0.offset) (<= (+ cstrspn_~sc1~0.offset 2) (select |#length| cstrspn_~sc1~0.base)))] [2018-02-02 09:48:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:48:21,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:48:21,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:48:21,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:48:21,311 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 23 states. [2018-02-02 09:48:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:48:22,121 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-02-02 09:48:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:48:22,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-02-02 09:48:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:48:22,157 INFO L225 Difference]: With dead ends: 156 [2018-02-02 09:48:22,157 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:48:22,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=2146, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:48:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:48:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:48:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:48:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:48:22,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-02-02 09:48:22,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:48:22,158 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:48:22,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:48:22,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:48:22,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:48:22,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:48:22 BoogieIcfgContainer [2018-02-02 09:48:22,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:48:22,162 INFO L168 Benchmark]: Toolchain (without parser) took 6467.01 ms. Allocated memory was 402.1 MB in the beginning and 757.6 MB in the end (delta: 355.5 MB). Free memory was 360.3 MB in the beginning and 594.2 MB in the end (delta: -233.9 MB). Peak memory consumption was 121.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:22,162 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:48:22,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.08 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:22,163 INFO L168 Benchmark]: Boogie Preprocessor took 26.78 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:22,163 INFO L168 Benchmark]: RCFGBuilder took 243.21 ms. Allocated memory is still 402.1 MB. Free memory was 347.0 MB in the beginning and 326.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:22,163 INFO L168 Benchmark]: TraceAbstraction took 6040.56 ms. Allocated memory was 402.1 MB in the beginning and 757.6 MB in the end (delta: 355.5 MB). Free memory was 326.4 MB in the beginning and 594.2 MB in the end (delta: -267.9 MB). Peak memory consumption was 87.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:48:22,164 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.10 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.08 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.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 26.78 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 243.21 ms. Allocated memory is still 402.1 MB. Free memory was 347.0 MB in the beginning and 326.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6040.56 ms. Allocated memory was 402.1 MB in the beginning and 757.6 MB in the end (delta: 355.5 MB). Free memory was 326.4 MB in the beginning and 594.2 MB in the end (delta: -267.9 MB). Peak memory consumption was 87.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 6.0s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 692 SDtfs, 1399 SDslu, 2318 SDs, 0 SdLazy, 2434 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 16/118 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, 18 MinimizatonAttempts, 196 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 493 ConstructedInterpolants, 0 QuantifiedInterpolants, 166048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 16/118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-48-22-171.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-48-22-171.csv Received shutdown request...