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_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:54,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:54,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:54,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:54,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:54,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:54,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:54,774 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:54,775 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:54,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:54,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:54,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:54,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:54,779 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:54,780 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:54,782 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:54,784 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:54,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:54,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:54,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:54,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:54,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:54,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:54,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:54,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:54,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:54,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:54,793 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:54,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:54,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:54,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:54,794 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_NoArray.epf [2018-02-02 10:36:54,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:54,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:54,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:54,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:54,804 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:54,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:54,805 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:54,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:54,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:54,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:54,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:54,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:54,807 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:54,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:54,844 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:54,847 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:54,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:54,848 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:54,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:54,968 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:54,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:54,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:54,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:54,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:54,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:54" (1/1) ... [2018-02-02 10:36:54,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3390db28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:54, skipping insertion in model container [2018-02-02 10:36:54,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:54" (1/1) ... [2018-02-02 10:36:54,989 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:55,021 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:55,114 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:55,128 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:55,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55 WrapperNode [2018-02-02 10:36:55,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:55,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:55,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:55,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:55,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... [2018-02-02 10:36:55,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:55,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:55,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:55,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:55,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:55,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:55,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:55,202 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-02 10:36:55,202 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:55,202 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:55,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:55,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:55,334 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:55,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:55 BoogieIcfgContainer [2018-02-02 10:36:55,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:55,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:55,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:55,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:55,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:54" (1/3) ... [2018-02-02 10:36:55,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590dc33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:55, skipping insertion in model container [2018-02-02 10:36:55,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:55" (2/3) ... [2018-02-02 10:36:55,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590dc33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:55, skipping insertion in model container [2018-02-02 10:36:55,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:55" (3/3) ... [2018-02-02 10:36:55,340 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:55,345 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:55,349 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 10:36:55,393 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:55,393 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:55,393 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:55,393 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:55,393 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:55,393 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:55,393 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:55,394 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:55,394 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 10:36:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:36:55,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:55,414 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:55,415 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-02 10:36:55,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:55,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:55,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:55,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,560 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(= 1 (select |#valid| |main_#t~malloc6.base|)), 40#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 10:36:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:36:55,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:36:55,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:36:55,575 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-02 10:36:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:55,673 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 10:36:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:36:55,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-02 10:36:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:55,680 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:36:55,680 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:36:55,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:36:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 10:36:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 10:36:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-02 10:36:55,699 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-02 10:36:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:55,700 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-02 10:36:55,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:36:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-02 10:36:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:36:55,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:55,700 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:55,700 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-02 10:36:55,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:55,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:55,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:55,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,771 INFO L182 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(<= 1 main_~length1~0), 109#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 110#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 10:36:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:55,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:55,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:55,774 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-02 10:36:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:55,807 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-02 10:36:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:55,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 10:36:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:55,808 INFO L225 Difference]: With dead ends: 29 [2018-02-02 10:36:55,808 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 10:36:55,809 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 10:36:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 10:36:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 10:36:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 10:36:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-02 10:36:55,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-02 10:36:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:55,812 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-02 10:36:55,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-02 10:36:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:36:55,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:55,813 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:55,813 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-02 10:36:55,814 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:55,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:55,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:55,862 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,863 INFO L182 omatonBuilderFactory]: Interpolants [171#true, 172#false, 173#(= 1 (select |#valid| main_~nondetString1~0.base)), 174#(= 1 (select |#valid| |cstrnlen_#in~str.base|)), 175#(= 1 (select |#valid| cstrnlen_~cp~0.base))] [2018-02-02 10:36:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:55,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:55,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:55,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:55,864 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-02 10:36:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:55,903 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-02 10:36:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:55,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 10:36:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:55,904 INFO L225 Difference]: With dead ends: 28 [2018-02-02 10:36:55,904 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 10:36:55,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 10:36:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 10:36:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:36:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-02 10:36:55,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-02 10:36:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:55,908 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-02 10:36:55,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-02 10:36:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:36:55,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:55,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:55,909 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-02 10:36:55,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:55,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:56,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:56,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,011 INFO L182 omatonBuilderFactory]: Interpolants [240#(and (= 0 |cstrnlen_#in~str.offset|) (<= 1 (select |#length| |cstrnlen_#in~str.base|))), 241#(and (<= 1 (select |#length| cstrnlen_~cp~0.base)) (= cstrnlen_~cp~0.offset 0)), 234#true, 235#false, 236#(<= 1 main_~length1~0), 237#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 238#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 239#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))] [2018-02-02 10:36:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:56,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:56,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:56,012 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-02 10:36:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:56,094 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-02 10:36:56,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:56,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 10:36:56,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:56,097 INFO L225 Difference]: With dead ends: 37 [2018-02-02 10:36:56,097 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 10:36:56,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 10:36:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-02 10:36:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 10:36:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-02 10:36:56,099 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-02 10:36:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:56,100 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-02 10:36:56,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-02 10:36:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:56,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:56,100 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:56,100 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-02 10:36:56,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:56,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:56,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:56,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,131 INFO L182 omatonBuilderFactory]: Interpolants [314#true, 315#false, 316#(not |cstrnlen_#t~short3|)] [2018-02-02 10:36:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:36:56,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:36:56,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:36:56,132 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-02 10:36:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:56,143 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-02 10:36:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:36:56,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 10:36:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:56,144 INFO L225 Difference]: With dead ends: 32 [2018-02-02 10:36:56,144 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:36:56,145 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:36:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:36:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 10:36:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 10:36:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-02 10:36:56,148 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-02 10:36:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:56,149 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-02 10:36:56,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:36:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-02 10:36:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:56,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:56,150 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] [2018-02-02 10:36:56,150 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-02 10:36:56,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:56,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:56,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:36:56,248 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,248 INFO L182 omatonBuilderFactory]: Interpolants [384#(and (<= 1 |cstrnlen_#in~maxlen|) (<= |cstrnlen_#in~maxlen| 1)), 385#(and (<= 1 cstrnlen_~maxlen) (<= cstrnlen_~maxlen 1)), 386#(and (<= cstrnlen_~maxlen (* 4294967296 (div cstrnlen_~maxlen 4294967296))) (< 0 (+ (div cstrnlen_~maxlen 4294967296) 1))), 387#(not |cstrnlen_#t~short3|), 381#true, 382#false, 383#(and (<= 1 main_~n~0) (<= main_~n~0 1))] [2018-02-02 10:36:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:36:56,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:36:56,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:36:56,249 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-02-02 10:36:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:56,342 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-02 10:36:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:36:56,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 10:36:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:56,343 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:36:56,343 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:36:56,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:36:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:36:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-02 10:36:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 10:36:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 10:36:56,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 10:36:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:56,348 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 10:36:56,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:36:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 10:36:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:56,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:56,349 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] [2018-02-02 10:36:56,349 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 122677308, now seen corresponding path program 1 times [2018-02-02 10:36:56,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:56,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:56,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:36:56,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,453 INFO L182 omatonBuilderFactory]: Interpolants [512#(not |cstrnlen_#t~short3|), 503#true, 504#false, 505#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 506#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 507#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 508#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 509#(= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) |cstrnlen_#in~str.offset|)), 510#(= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)), 511#(= 0 |cstrnlen_#t~mem2|)] [2018-02-02 10:36:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:36:56,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:36:56,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:56,454 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 10 states. [2018-02-02 10:36:56,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:56,558 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 10:36:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:36:56,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:36:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:56,559 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:36:56,559 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:36:56,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:36:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:36:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-02 10:36:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:36:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-02 10:36:56,565 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-02 10:36:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:56,565 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-02 10:36:56,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:36:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-02 10:36:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:56,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:56,567 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] [2018-02-02 10:36:56,567 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-02 10:36:56,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:56,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:56,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:36:56,759 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,759 INFO L182 omatonBuilderFactory]: Interpolants [673#true, 674#false, 675#(<= 1 main_~length1~0), 676#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 677#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 678#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base)))), 679#(and (= 0 |cstrnlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) |cstrnlen_#in~str.offset|)) (<= 2 (select |#length| |cstrnlen_#in~str.base|)))), 680#(and (= cstrnlen_~cp~0.offset 0) (or (= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)) (<= 2 (select |#length| cstrnlen_~cp~0.base)))), 681#(and (= cstrnlen_~cp~0.offset 0) (or (<= 2 (select |#length| cstrnlen_~cp~0.base)) (= 0 |cstrnlen_#t~mem2|))), 682#(and (= cstrnlen_~cp~0.offset 0) (or (not |cstrnlen_#t~short3|) (<= 2 (select |#length| cstrnlen_~cp~0.base)))), 683#(and (= cstrnlen_~cp~0.offset 0) (<= 2 (select |#length| cstrnlen_~cp~0.base))), 684#(and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 1) (select |#length| cstrnlen_~cp~0.base)))] [2018-02-02 10:36:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:56,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:36:56,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:36:56,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:36:56,760 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 12 states. [2018-02-02 10:36:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:56,982 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-02 10:36:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:36:56,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-02 10:36:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:56,983 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:36:56,983 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:36:56,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:36:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:36:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-02 10:36:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 10:36:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-02 10:36:56,989 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-02 10:36:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:56,989 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-02 10:36:56,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:36:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-02 10:36:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:36:56,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:56,990 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:56,990 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-02 10:36:56,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:57,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:57,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:57,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:36:57,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:57,037 INFO L182 omatonBuilderFactory]: Interpolants [857#true, 858#false, 859#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 860#(and (or (<= (div cstrnlen_~maxlen 4294967296) 0) (<= cstrnlen_~maxlen |cstrnlen_#in~maxlen|)) (or (<= |cstrnlen_#in~maxlen| cstrnlen_~maxlen) (< 0 (div cstrnlen_~maxlen 4294967296)))), 861#(or (<= 4294967296 |cstrnlen_#in~maxlen|) |cstrnlen_#t~short3| (<= |cstrnlen_#in~maxlen| 0)), 862#(or (<= 4294967296 |cstrnlen_#in~maxlen|) (<= |cstrnlen_#in~maxlen| 0))] [2018-02-02 10:36:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:36:57,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:36:57,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:36:57,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:57,038 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-02 10:36:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:57,097 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-02 10:36:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:36:57,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 10:36:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:57,100 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:36:57,100 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:36:57,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:36:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-02 10:36:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:36:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-02 10:36:57,110 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-02 10:36:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:57,110 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-02 10:36:57,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:36:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-02 10:36:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:36:57,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:57,112 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:57,112 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-02 10:36:57,113 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:57,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:57,129 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:36:57,132 INFO L168 Benchmark]: Toolchain (without parser) took 2162.57 ms. Allocated memory was 402.7 MB in the beginning and 627.6 MB in the end (delta: 224.9 MB). Free memory was 359.5 MB in the beginning and 498.1 MB in the end (delta: -138.6 MB). Peak memory consumption was 86.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:57,133 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:57,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.34 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:57,133 INFO L168 Benchmark]: Boogie Preprocessor took 24.03 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:57,133 INFO L168 Benchmark]: RCFGBuilder took 176.45 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 330.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:57,133 INFO L168 Benchmark]: TraceAbstraction took 1795.75 ms. Allocated memory was 402.7 MB in the beginning and 627.6 MB in the end (delta: 224.9 MB). Free memory was 330.9 MB in the beginning and 498.1 MB in the end (delta: -167.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:57,135 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.27 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.34 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.03 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 176.45 ms. Allocated memory is still 402.7 MB. Free memory was 347.6 MB in the beginning and 330.9 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1795.75 ms. Allocated memory was 402.7 MB in the beginning and 627.6 MB in the end (delta: 224.9 MB). Free memory was 330.9 MB in the beginning and 498.1 MB in the end (delta: -167.2 MB). Peak memory consumption was 57.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-36-57-141.csv Received shutdown request...