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/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:49:37,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:49:37,941 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:49:37,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:49:37,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:49:37,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:49:37,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:49:37,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:49:37,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:49:37,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:49:37,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:49:37,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:49:37,955 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:49:37,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:49:37,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:49:37,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:49:37,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:49:37,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:49:37,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:49:37,963 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:49:37,965 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:49:37,965 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:49:37,966 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:49:37,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:49:37,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:49:37,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:49:37,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:49:37,969 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:49:37,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:49:37,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:49:37,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:49:37,970 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:49:37,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:49:37,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:49:37,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:49:37,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:49:37,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:49:37,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:49:37,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:49:37,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:49:37,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:49:37,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:49:37,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:49:37,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:49:37,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:49:38,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:49:38,026 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:49:38,031 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:49:38,032 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:49:38,032 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:49:38,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:49:38,161 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:49:38,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:49:38,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:49:38,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:49:38,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:49:38,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38, skipping insertion in model container [2018-02-02 09:49:38,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,181 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:49:38,209 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:49:38,296 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:49:38,310 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:49:38,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38 WrapperNode [2018-02-02 09:49:38,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:49:38,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:49:38,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:49:38,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:49:38,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (1/1) ... [2018-02-02 09:49:38,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:49:38,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:49:38,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:49:38,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:49:38,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (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:49:38,384 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:49:38,384 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:49:38,384 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-02-02 09:49:38,384 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:49:38,384 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:49:38,384 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:49:38,385 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:49:38,518 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:49:38,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:49:38 BoogieIcfgContainer [2018-02-02 09:49:38,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:49:38,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:49:38,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:49:38,521 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:49:38,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:49:38" (1/3) ... [2018-02-02 09:49:38,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:49:38, skipping insertion in model container [2018-02-02 09:49:38,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:49:38" (2/3) ... [2018-02-02 09:49:38,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5c803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:49:38, skipping insertion in model container [2018-02-02 09:49:38,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:49:38" (3/3) ... [2018-02-02 09:49:38,523 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:49:38,528 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:49:38,533 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 09:49:38,569 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:49:38,569 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:49:38,569 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:49:38,569 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:49:38,569 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:49:38,569 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:49:38,569 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:49:38,569 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:49:38,570 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:49:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-02-02 09:49:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:49:38,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:38,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:38,587 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-02-02 09:49:38,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:38,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:38,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:38,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:49:38,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:38,781 INFO 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:49:38,781 INFO L182 omatonBuilderFactory]: Interpolants [48#true, 49#false, 50#(= (select |#valid| |main_#t~malloc6.base|) 1), 51#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 09:49:38,781 INFO 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:49:38,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:49:38,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:49:38,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:49:38,792 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-02-02 09:49:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:38,916 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 09:49:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:49:38,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:49:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:38,926 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:49:38,926 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:49:38,928 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:49:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:49:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 09:49:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 09:49:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 09:49:38,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-02-02 09:49:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:38,954 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 09:49:38,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:49:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 09:49:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:49:38,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:38,954 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:38,954 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-02-02 09:49:38,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:38,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:39,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,047 INFO L182 omatonBuilderFactory]: Interpolants [144#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 139#true, 140#false, 141#(<= 1 main_~length1~0), 142#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 143#(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))] [2018-02-02 09:49:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:39,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:39,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:39,049 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-02-02 09:49:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,112 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 09:49:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:39,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 09:49:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,113 INFO L225 Difference]: With dead ends: 40 [2018-02-02 09:49:39,113 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:49:39,114 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:49:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:49:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-02 09:49:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 09:49:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 09:49:39,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-02-02 09:49:39,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,119 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 09:49:39,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 09:49:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:49:39,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,120 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,120 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-02-02 09:49:39,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,150 INFO 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:49:39,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:49:39,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,151 INFO 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:49:39,151 INFO L182 omatonBuilderFactory]: Interpolants [227#true, 228#false, 229#(= 1 (select |#valid| |main_#t~malloc7.base|)), 230#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-02 09:49:39,151 INFO 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:49:39,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:49:39,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:49:39,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:49:39,152 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-02-02 09:49:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,205 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 09:49:39,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:49:39,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:49:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,206 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:49:39,206 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 09:49:39,206 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:49:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 09:49:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 09:49:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 09:49:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 09:49:39,209 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-02-02 09:49:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,210 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 09:49:39,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:49:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 09:49:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:49:39,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,210 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,211 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-02-02 09:49:39,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,264 INFO 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:49:39,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:49:39,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,264 INFO 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:49:39,265 INFO L182 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(<= 1 main_~length2~0), 314#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 315#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-02 09:49:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:49:39,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:49:39,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:49:39,266 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-02-02 09:49:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,306 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 09:49:39,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:39,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:49:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,308 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:49:39,308 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:49:39,308 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:49:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:49:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 09:49:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:49:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 09:49:39,311 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-02 09:49:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,312 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 09:49:39,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:49:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 09:49:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:49:39,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,312 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,312 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-02-02 09:49:39,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:39,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,357 INFO 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:49:39,357 INFO L182 omatonBuilderFactory]: Interpolants [394#true, 395#false, 396#(= 1 (select |#valid| main_~nondetString1~0.base)), 397#(= 1 (select |#valid| |cstrcspn_#in~s1.base|)), 398#(= 1 (select |#valid| cstrcspn_~p~0.base)), 399#(= 1 (select |#valid| |cstrcspn_#t~post0.base|))] [2018-02-02 09:49:39,357 INFO 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:49:39,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:39,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:39,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:39,358 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-02-02 09:49:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,437 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-02-02 09:49:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:49:39,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:49:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,438 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:49:39,438 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:49:39,438 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:49:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:49:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 09:49:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:49:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-02 09:49:39,440 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-02-02 09:49:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,440 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-02 09:49:39,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-02 09:49:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:49:39,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,441 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,441 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-02-02 09:49:39,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,534 INFO 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:49:39,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:49:39,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,535 INFO 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:49:39,535 INFO L182 omatonBuilderFactory]: Interpolants [480#(<= 1 main_~length1~0), 481#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 482#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 483#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 484#(and (<= 1 (select |#length| |cstrcspn_#in~s1.base|)) (= 0 |cstrcspn_#in~s1.offset|)), 485#(and (= 0 cstrcspn_~p~0.offset) (<= 1 (select |#length| cstrcspn_~p~0.base))), 486#(and (= |cstrcspn_#t~post0.offset| 0) (<= 1 (select |#length| |cstrcspn_#t~post0.base|))), 478#true, 479#false] [2018-02-02 09:49:39,535 INFO 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:49:39,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:49:39,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:49:39,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:49:39,536 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-02-02 09:49:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,631 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 09:49:39,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:49:39,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 09:49:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,631 INFO L225 Difference]: With dead ends: 41 [2018-02-02 09:49:39,632 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:49:39,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:39,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:49:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-02-02 09:49:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 09:49:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-02 09:49:39,634 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-02-02 09:49:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,634 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-02 09:49:39,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:49:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-02 09:49:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:39,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,635 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,635 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-02-02 09:49:39,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,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:49:39,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:49:39,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,675 INFO 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:49:39,676 INFO L182 omatonBuilderFactory]: Interpolants [578#true, 579#false, 580#(= 1 (select |#valid| main_~nondetString2~0.base)), 581#(= 1 (select |#valid| |cstrcspn_#in~s2.base|)), 582#(= 1 (select |#valid| cstrcspn_~s2.base)), 583#(= 1 (select |#valid| cstrcspn_~spanp~0.base)), 584#(= 1 (select |#valid| |cstrcspn_#t~post2.base|))] [2018-02-02 09:49:39,676 INFO 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:49:39,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:49:39,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:49:39,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:49:39,677 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-02-02 09:49:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,747 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 09:49:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:49:39,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 09:49:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,747 INFO L225 Difference]: With dead ends: 40 [2018-02-02 09:49:39,748 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:49:39,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:49:39,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:49:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-02-02 09:49:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 09:49:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 09:49:39,750 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-02-02 09:49:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,750 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 09:49:39,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:49:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 09:49:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:49:39,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,750 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-02-02 09:49:39,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:39,847 INFO 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:49:39,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:39,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:49:39,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,848 INFO L182 omatonBuilderFactory]: Interpolants [672#(<= 1 main_~length2~0), 673#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 674#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 675#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 676#(and (= 0 |cstrcspn_#in~s2.offset|) (<= 1 (select |#length| |cstrcspn_#in~s2.base|))), 677#(and (<= 1 (select |#length| cstrcspn_~s2.base)) (= 0 cstrcspn_~s2.offset)), 678#(and (<= 1 (select |#length| cstrcspn_~spanp~0.base)) (= 0 cstrcspn_~spanp~0.offset)), 679#(and (<= 1 (select |#length| |cstrcspn_#t~post2.base|)) (= |cstrcspn_#t~post2.offset| 0)), 670#true, 671#false] [2018-02-02 09:49:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:39,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:49:39,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:49:39,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:49:39,849 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-02-02 09:49:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:39,960 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 09:49:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:49:39,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 09:49:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:39,961 INFO L225 Difference]: With dead ends: 43 [2018-02-02 09:49:39,961 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 09:49:39,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 09:49:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-02-02 09:49:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 09:49:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 09:49:39,964 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-02-02 09:49:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:39,964 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 09:49:39,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:49:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 09:49:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:49:39,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:39,965 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:39,965 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-02-02 09:49:39,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:39,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:40,072 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:49:40,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:40,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:49:40,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:40,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:40,072 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 775#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 776#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1)), 777#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 778#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) |cstrcspn_#in~s2.offset|)), 779#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset)), 780#(= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset)), 781#(= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)), 782#(= 0 |cstrcspn_#t~mem3|), 783#(= cstrcspn_~sc~0 0)] [2018-02-02 09:49:40,073 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:49:40,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:49:40,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:49:40,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:49:40,073 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-02-02 09:49:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:40,323 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-02-02 09:49:40,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:49:40,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 09:49:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:40,324 INFO L225 Difference]: With dead ends: 79 [2018-02-02 09:49:40,324 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 09:49:40,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:49:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 09:49:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-02-02 09:49:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:49:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-02 09:49:40,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-02-02 09:49:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:40,329 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-02 09:49:40,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:49:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-02 09:49:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:49:40,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:40,330 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:40,330 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-02-02 09:49:40,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:40,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:40,534 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:49:40,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:40,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:49:40,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:40,535 INFO 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:49:40,535 INFO L182 omatonBuilderFactory]: Interpolants [960#(and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)), 961#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 1 |cstrcspn_#t~post2.offset|)), 948#true, 949#false, 950#(<= 1 main_~length2~0), 951#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 952#(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)))), 953#(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))))), 954#(and (or (<= 2 (select |#length| |cstrcspn_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) |cstrcspn_#in~s2.offset|))) (= 0 |cstrcspn_#in~s2.offset|)), 955#(and (or (<= 2 (select |#length| cstrcspn_~s2.base)) (= 0 (select (select |#memory_int| cstrcspn_~s2.base) cstrcspn_~s2.offset))) (= 0 cstrcspn_~s2.offset)), 956#(and (or (<= 2 (select |#length| cstrcspn_~spanp~0.base)) (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset))) (= 0 cstrcspn_~spanp~0.offset)), 957#(and (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (= |cstrcspn_#t~post2.offset| 0) (or (<= (+ cstrcspn_~spanp~0.offset 1) (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|)) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)))), 958#(and (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (= 0 |cstrcspn_#t~mem3|)) (<= 1 cstrcspn_~spanp~0.offset)), 959#(and (or (= cstrcspn_~sc~0 0) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))) (<= 1 cstrcspn_~spanp~0.offset))] [2018-02-02 09:49:40,535 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:49:40,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:49:40,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:49:40,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:49:40,536 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 14 states. [2018-02-02 09:49:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:40,865 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-02 09:49:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:40,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-02-02 09:49:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:40,867 INFO L225 Difference]: With dead ends: 78 [2018-02-02 09:49:40,867 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 09:49:40,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:49:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 09:49:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-02-02 09:49:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 09:49:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 09:49:40,872 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-02-02 09:49:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:40,872 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 09:49:40,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:49:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 09:49:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:49:40,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:40,873 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:40,873 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-02-02 09:49:40,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:40,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:41,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:49:41,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:41,158 INFO 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:49:41,158 INFO L182 omatonBuilderFactory]: Interpolants [1130#true, 1131#false, 1132#(<= 1 main_~length1~0), 1133#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1134#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1135#(and (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1136#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1137#(and (= 0 main_~nondetString1~0.offset) (or (= (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) 0) (<= 2 (select |#length| main_~nondetString1~0.base))) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1138#(and (= 0 |cstrcspn_#in~s1.offset|) (or (<= 2 (select |#length| |cstrcspn_#in~s1.base|)) (= (select (select |#memory_int| |cstrcspn_#in~s1.base|) |cstrcspn_#in~s1.offset|) 0))), 1139#(and (= 0 cstrcspn_~p~0.offset) (or (= (select (select |#memory_int| cstrcspn_~p~0.base) cstrcspn_~p~0.offset) 0) (<= 2 (select |#length| cstrcspn_~p~0.base)))), 1140#(and (or (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (and (<= (+ cstrcspn_~p~0.offset 1) (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|))) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset))) (= |cstrcspn_#t~post0.offset| 0)), 1141#(or (= |cstrcspn_#t~mem1| 0) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1142#(or (= cstrcspn_~c~0 0) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1143#(or (not (= cstrcspn_~sc~0 0)) (and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 1144#(and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base))), 1145#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 1 |cstrcspn_#t~post0.offset|))] [2018-02-02 09:49:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:49:41,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:49:41,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:41,159 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 16 states. [2018-02-02 09:49:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:41,449 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-02-02 09:49:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:49:41,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-02 09:49:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:41,451 INFO L225 Difference]: With dead ends: 100 [2018-02-02 09:49:41,451 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 09:49:41,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:49:41,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 09:49:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-02 09:49:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 09:49:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-02-02 09:49:41,457 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 28 [2018-02-02 09:49:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:41,458 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-02-02 09:49:41,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:49:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-02-02 09:49:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:49:41,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:41,459 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:41,459 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1759144044, now seen corresponding path program 1 times [2018-02-02 09:49:41,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:41,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:41,543 INFO 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:49:41,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:49:41,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:49:41,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,547 INFO L182 omatonBuilderFactory]: Interpolants [1367#true, 1368#false, 1369#(= |#valid| |old(#valid)|), 1370#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1371#(and (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= (store (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |main_#t~malloc7.base| 0) |old(#valid)|)), 1372#(= |old(#valid)| (store |#valid| |main_#t~malloc7.base| (select (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc7.base|)))] [2018-02-02 09:49:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:49:41,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:49:41,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:49:41,547 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 6 states. [2018-02-02 09:49:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:41,605 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2018-02-02 09:49:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:49:41,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 09:49:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:41,606 INFO L225 Difference]: With dead ends: 92 [2018-02-02 09:49:41,606 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 09:49:41,606 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:49:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 09:49:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 09:49:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 09:49:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-02 09:49:41,609 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2018-02-02 09:49:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:41,609 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-02 09:49:41,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:49:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-02 09:49:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:49:41,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:41,609 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:41,609 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1832996809, now seen corresponding path program 2 times [2018-02-02 09:49:41,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:41,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:41,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:49:41,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:41,824 INFO 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:49:41,824 INFO L182 omatonBuilderFactory]: Interpolants [1551#true, 1552#false, 1553#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1554#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 1555#(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))))), 1556#(and (or (<= (select |#length| |cstrcspn_#in~s2.base|) 1) (= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) 1)) (<= 3 (select |#length| |cstrcspn_#in~s2.base|))) (= 0 |cstrcspn_#in~s2.offset|)), 1557#(and (or (<= (select |#length| cstrcspn_~s2.base) 1) (= 0 (select (select |#memory_int| cstrcspn_~s2.base) 1)) (<= 3 (select |#length| cstrcspn_~s2.base))) (= 0 cstrcspn_~s2.offset)), 1558#(and (or (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= (select |#length| cstrcspn_~spanp~0.base) 1) (<= 3 (select |#length| cstrcspn_~spanp~0.base))) (= 0 cstrcspn_~spanp~0.offset)), 1559#(and (or (and (or (<= (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|) cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 2) (+ (select |#length| cstrcspn_~spanp~0.base) |cstrcspn_#t~post2.offset|))) (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset)) (and (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (<= cstrcspn_~spanp~0.offset (+ |cstrcspn_#t~post2.offset| 1)))) (= |cstrcspn_#t~post2.offset| 0)), 1560#(or (and (or (<= (select |#length| cstrcspn_~spanp~0.base) cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 2) (select |#length| cstrcspn_~spanp~0.base))) (<= 1 cstrcspn_~spanp~0.offset)) (and (= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) 1)) (<= cstrcspn_~spanp~0.offset 1) (<= 1 cstrcspn_~spanp~0.offset))), 1561#(or (and (= 1 |cstrcspn_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))) (and (<= 2 cstrcspn_~spanp~0.offset) (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= (select |#length| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|)))), 1562#(or (and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))) (= 0 |cstrcspn_#t~mem3|)), 1563#(or (= cstrcspn_~sc~0 0) (and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)))), 1564#(and (<= 2 cstrcspn_~spanp~0.offset) (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base))), 1565#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 2 |cstrcspn_#t~post2.offset|))] [2018-02-02 09:49:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:41,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:49:41,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:49:41,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:49:41,825 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 15 states. [2018-02-02 09:49:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:42,212 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-02-02 09:49:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:49:42,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-02 09:49:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:42,213 INFO L225 Difference]: With dead ends: 104 [2018-02-02 09:49:42,213 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 09:49:42,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:49:42,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 09:49:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2018-02-02 09:49:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 09:49:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-02-02 09:49:42,217 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 32 [2018-02-02 09:49:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:42,217 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-02-02 09:49:42,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:49:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-02-02 09:49:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:49:42,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:42,218 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:49:42,218 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1916750925, now seen corresponding path program 2 times [2018-02-02 09:49:42,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:42,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:42,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:42,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:49:42,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:42,515 INFO 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:49:42,515 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1793#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1794#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1) (= (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) 0)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 1795#(and (or (<= 3 (select |#length| |cstrcspn_#in~s1.base|)) (= (select (select |#memory_int| |cstrcspn_#in~s1.base|) 1) 0) (<= (select |#length| |cstrcspn_#in~s1.base|) 1)) (= 0 |cstrcspn_#in~s1.offset|)), 1796#(and (= 0 cstrcspn_~p~0.offset) (or (= (select (select |#memory_int| cstrcspn_~p~0.base) 1) 0) (<= 3 (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| cstrcspn_~p~0.base) 1))), 1797#(and (= |cstrcspn_#t~post0.offset| 0) (or (and (or (<= (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|)) cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 2) (+ |cstrcspn_#t~post0.offset| (select |#length| |cstrcspn_#t~post0.base|)))) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset)) (and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) 1) 0) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base) (<= cstrcspn_~p~0.offset (+ |cstrcspn_#t~post0.offset| 1)) (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset)))), 1798#(or (and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 2) (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| cstrcspn_~p~0.base) cstrcspn_~p~0.offset))) (and (<= 1 cstrcspn_~p~0.offset) (= (select (select |#memory_int| cstrcspn_~p~0.base) 1) 0) (<= cstrcspn_~p~0.offset 1))), 1799#(or (and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (= 1 |cstrcspn_#t~post0.offset|)) (and (<= 2 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= (select |#length| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|)))), 1800#(or (= |cstrcspn_#t~mem1| 0) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1801#(or (= cstrcspn_~c~0 0) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1802#(or (not (= cstrcspn_~sc~0 0)) (and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset))), 1803#(and (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (<= 2 cstrcspn_~p~0.offset)), 1804#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 2 |cstrcspn_#t~post0.offset|)), 1788#true, 1789#false, 1790#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1791#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)))] [2018-02-02 09:49:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:49:42,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:49:42,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:49:42,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:49:42,516 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 17 states. [2018-02-02 09:49:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:42,946 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-02 09:49:42,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:49:42,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-02-02 09:49:42,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:42,947 INFO L225 Difference]: With dead ends: 126 [2018-02-02 09:49:42,947 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 09:49:42,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:49:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 09:49:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-02-02 09:49:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 09:49:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 09:49:42,951 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 37 [2018-02-02 09:49:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:42,951 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 09:49:42,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:49:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 09:49:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 09:49:42,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:42,952 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-02 09:49:42,952 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -685943431, now seen corresponding path program 3 times [2018-02-02 09:49:42,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:42,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:49:43,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:43,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:49:43,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:43,096 INFO 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:49:43,096 INFO L182 omatonBuilderFactory]: Interpolants [2083#true, 2084#false, 2085#(and (= 0 |main_#t~malloc7.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 2086#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2087#(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)))))), 2088#(= 0 (select (select |#memory_int| |cstrcspn_#in~s2.base|) (+ (select |#length| |cstrcspn_#in~s2.base|) (- 1)))), 2089#(= 0 (select (select |#memory_int| cstrcspn_~s2.base) (+ (select |#length| cstrcspn_~s2.base) (- 1)))), 2090#(= 0 (select (select |#memory_int| cstrcspn_~spanp~0.base) (+ (select |#length| cstrcspn_~spanp~0.base) (- 1)))), 2091#(or (and (<= (+ |cstrcspn_#t~post2.offset| 1) cstrcspn_~spanp~0.offset) (or (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= (select |#length| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))) (= 0 (select (select |#memory_int| |cstrcspn_#t~post2.base|) |cstrcspn_#t~post2.offset|))), 2092#(or (and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)) (= 0 |cstrcspn_#t~mem3|)), 2093#(or (= cstrcspn_~sc~0 0) (and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset))), 2094#(and (<= (+ cstrcspn_~spanp~0.offset 1) (select |#length| cstrcspn_~spanp~0.base)) (<= 1 cstrcspn_~spanp~0.offset)), 2095#(and (<= (+ |cstrcspn_#t~post2.offset| 1) (select |#length| |cstrcspn_#t~post2.base|)) (<= 1 |cstrcspn_#t~post2.offset|))] [2018-02-02 09:49:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 09:49:43,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:49:43,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:49:43,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:49:43,097 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 13 states. [2018-02-02 09:49:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:43,520 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-02 09:49:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:43,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 09:49:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:43,521 INFO L225 Difference]: With dead ends: 121 [2018-02-02 09:49:43,521 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 09:49:43,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:49:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 09:49:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 85. [2018-02-02 09:49:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 09:49:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-02-02 09:49:43,524 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 37 [2018-02-02 09:49:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:43,525 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-02-02 09:49:43,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:49:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-02-02 09:49:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:49:43,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:49:43,525 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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:49:43,526 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:49:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1271271661, now seen corresponding path program 3 times [2018-02-02 09:49:43,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:49:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:49:43,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:49:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 09:49:43,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:49:43,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:49:43,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:49:43,728 INFO 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:49:43,728 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (<= (+ |cstrcspn_#t~post0.offset| 1) cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|) 0) (<= (select |#length| |cstrcspn_#t~post0.base|) |cstrcspn_#t~post0.offset|))), 2337#(and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= |cstrcspn_#t~mem1| 0))), 2338#(and (<= 1 cstrcspn_~p~0.offset) (or (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)) (= cstrcspn_~c~0 0))), 2339#(and (<= 1 cstrcspn_~p~0.offset) (or (not (= cstrcspn_~sc~0 0)) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base)))), 2340#(and (<= 1 cstrcspn_~p~0.offset) (<= (+ cstrcspn_~p~0.offset 1) (select |#length| cstrcspn_~p~0.base))), 2341#(and (<= (+ |cstrcspn_#t~post0.offset| 1) (select |#length| |cstrcspn_#t~post0.base|)) (<= 1 |cstrcspn_#t~post0.offset|)), 2326#true, 2327#false, 2328#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 2329#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2330#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base |main_#t~malloc7.base|)) (= main_~nondetString1~0.offset 0)), 2331#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2332#(and (= (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)))) 0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2333#(= (select (select |#memory_int| |cstrcspn_#in~s1.base|) (+ (select |#length| |cstrcspn_#in~s1.base|) (- 1))) 0), 2334#(= (select (select |#memory_int| cstrcspn_~p~0.base) (+ (select |#length| cstrcspn_~p~0.base) (- 1))) 0), 2335#(and (= (select (select |#memory_int| |cstrcspn_#t~post0.base|) (+ (select |#length| |cstrcspn_#t~post0.base|) (- 1))) 0) (= |cstrcspn_#t~post0.base| cstrcspn_~p~0.base))] [2018-02-02 09:49:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 09:49:43,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:49:43,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:49:43,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:49:43,729 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 16 states. [2018-02-02 09:49:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:49:44,076 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-02 09:49:44,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:49:44,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 09:49:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:49:44,076 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:49:44,076 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:49:44,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:49:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:49:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:49:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:49:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:49:44,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-02-02 09:49:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:49:44,077 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:49:44,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:49:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:49:44,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:49:44,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:49:44 BoogieIcfgContainer [2018-02-02 09:49:44,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:49:44,082 INFO L168 Benchmark]: Toolchain (without parser) took 5920.45 ms. Allocated memory was 401.6 MB in the beginning and 722.5 MB in the end (delta: 320.9 MB). Free memory was 359.6 MB in the beginning and 480.7 MB in the end (delta: -121.1 MB). Peak memory consumption was 199.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:49:44,083 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:49:44,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.99 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 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:49:44,083 INFO L168 Benchmark]: Boogie Preprocessor took 25.44 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.3 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:49:44,083 INFO L168 Benchmark]: RCFGBuilder took 175.73 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 327.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:49:44,083 INFO L168 Benchmark]: TraceAbstraction took 5562.21 ms. Allocated memory was 401.6 MB in the beginning and 722.5 MB in the end (delta: 320.9 MB). Free memory was 326.5 MB in the beginning and 480.7 MB in the end (delta: -154.3 MB). Peak memory consumption was 166.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:49:44,085 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.99 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.44 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.73 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 327.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5562.21 ms. Allocated memory was 401.6 MB in the beginning and 722.5 MB in the end (delta: 320.9 MB). Free memory was 326.5 MB in the beginning and 480.7 MB in the end (delta: -154.3 MB). Peak memory consumption was 166.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: 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: 554]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. SAFE Result, 5.5s OverallTime, 16 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 459 SDtfs, 715 SDslu, 2001 SDs, 0 SdLazy, 2053 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 21/88 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, 16 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 108162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 21/88 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/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-49-44-091.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-49-44-091.csv Received shutdown request...