java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:59:10,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:59:10,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:59:10,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:59:10,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:59:10,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:59:10,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:59:10,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:59:10,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:59:10,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:59:10,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:59:10,411 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:59:10,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:59:10,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:59:10,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:59:10,415 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:59:10,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:59:10,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:59:10,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:59:10,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:59:10,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:59:10,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:59:10,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:59:10,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:59:10,423 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:59:10,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:59:10,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:59:10,425 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:59:10,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:59:10,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:59:10,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:59:10,426 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 20:59:10,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:59:10,436 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:59:10,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:59:10,437 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:59:10,437 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:59:10,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:59:10,437 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:59:10,437 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:59:10,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:59:10,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:59:10,439 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:59:10,439 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:59:10,439 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:59:10,439 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:59:10,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:59:10,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:10,440 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:59:10,440 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 20:59:10,440 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 20:59:10,440 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 20:59:10,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:59:10,482 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:59:10,489 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:59:10,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:59:10,492 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:59:10,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:10,627 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:59:10,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:59:10,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:10,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:59:10,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:59:10,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ee07db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10, skipping insertion in model container [2018-02-02 20:59:10,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,650 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:10,677 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:10,765 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:10,776 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:10,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10 WrapperNode [2018-02-02 20:59:10,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:10,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:59:10,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:59:10,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:59:10,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (1/1) ... [2018-02-02 20:59:10,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:59:10,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:59:10,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:59:10,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:59:10,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (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 20:59:10,839 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:59:10,839 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:59:10,839 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-02 20:59:10,839 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:59:10,839 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:59:10,839 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:59:10,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:59:10,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:59:10,839 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:59:10,840 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:59:10,840 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-02 20:59:10,840 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:59:10,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:59:10,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:59:10,965 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:59:10,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:10 BoogieIcfgContainer [2018-02-02 20:59:10,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:59:10,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:59:10,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:59:10,968 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:59:10,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:59:10" (1/3) ... [2018-02-02 20:59:10,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777d2661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:10, skipping insertion in model container [2018-02-02 20:59:10,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:10" (2/3) ... [2018-02-02 20:59:10,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777d2661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:10, skipping insertion in model container [2018-02-02 20:59:10,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:10" (3/3) ... [2018-02-02 20:59:10,970 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:10,975 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:59:10,980 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 20:59:11,002 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:59:11,002 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:59:11,003 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 20:59:11,003 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 20:59:11,003 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:59:11,003 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:59:11,003 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:59:11,003 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:59:11,003 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:59:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-02-02 20:59:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:11,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,023 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:11,023 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-02-02 20:59:11,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,030 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,066 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,066 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:11,154 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 20:59:11,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:11,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:11,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:11,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:11,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:11,168 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-02-02 20:59:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:11,253 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 20:59:11,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:11,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 20:59:11,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:11,260 INFO L225 Difference]: With dead ends: 40 [2018-02-02 20:59:11,260 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 20:59:11,261 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 20:59:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 20:59:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 20:59:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 20:59:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-02 20:59:11,351 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-02-02 20:59:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:11,351 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-02 20:59:11,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-02 20:59:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:11,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,351 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:11,352 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-02-02 20:59:11,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,352 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:11,455 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 20:59:11,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:11,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:11,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:11,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:11,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:11,457 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-02-02 20:59:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:11,501 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-02-02 20:59:11,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:59:11,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 20:59:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:11,502 INFO L225 Difference]: With dead ends: 36 [2018-02-02 20:59:11,502 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 20:59:11,503 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 20:59:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 20:59:11,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 20:59:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 20:59:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-02 20:59:11,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-02-02 20:59:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:11,507 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-02 20:59:11,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-02 20:59:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:59:11,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,508 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:11,508 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-02-02 20:59:11,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,508 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,509 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:11,559 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 20:59:11,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:11,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:11,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:11,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:11,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:11,560 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-02-02 20:59:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:11,598 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 20:59:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:59:11,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:59:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:11,599 INFO L225 Difference]: With dead ends: 33 [2018-02-02 20:59:11,599 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 20:59:11,600 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 20:59:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 20:59:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 20:59:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 20:59:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-02-02 20:59:11,602 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-02-02 20:59:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:11,602 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-02-02 20:59:11,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-02-02 20:59:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:59:11,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,603 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:11,603 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-02-02 20:59:11,603 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,603 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:11,686 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 20:59:11,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:11,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:59:11,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:59:11,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:59:11,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:11,688 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-02-02 20:59:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:11,760 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-02 20:59:11,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:59:11,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 20:59:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:11,763 INFO L225 Difference]: With dead ends: 45 [2018-02-02 20:59:11,763 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 20:59:11,763 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 20:59:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 20:59:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-02-02 20:59:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 20:59:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-02 20:59:11,765 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-02-02 20:59:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:11,766 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-02 20:59:11,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:59:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-02 20:59:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:59:11,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,766 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:11,766 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-02-02 20:59:11,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,767 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:11,805 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 20:59:11,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:11,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:11,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:59:11,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:59:11,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:59:11,806 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-02-02 20:59:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:11,816 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-02 20:59:11,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:59:11,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 20:59:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:11,817 INFO L225 Difference]: With dead ends: 43 [2018-02-02 20:59:11,817 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 20:59:11,817 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 20:59:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 20:59:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 20:59:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 20:59:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 20:59:11,821 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-02-02 20:59:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:11,821 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 20:59:11,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:59:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 20:59:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:11,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:11,822 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] [2018-02-02 20:59:11,822 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-02-02 20:59:11,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:11,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:11,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:11,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:11,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:12,031 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 20:59:12,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:12,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:12,032 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:12,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:12,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 20:59:12,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:12,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:12,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 20:59:12,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 20:59:12,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 20:59:12,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:12,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:12,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:12,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:23 [2018-02-02 20:59:12,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 20:59:12,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 20:59:12,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 20:59:12,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:12,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:12,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-02 20:59:12,350 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 20:59:12,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:12,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 20:59:12,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:59:12,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:59:12,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:59:12,352 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 20 states. [2018-02-02 20:59:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:12,851 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-02-02 20:59:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:59:12,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2018-02-02 20:59:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:12,852 INFO L225 Difference]: With dead ends: 65 [2018-02-02 20:59:12,852 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 20:59:12,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:59:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 20:59:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-02-02 20:59:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 20:59:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-02 20:59:12,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-02-02 20:59:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:12,858 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-02 20:59:12,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:59:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-02 20:59:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:59:12,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:12,859 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:12,859 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-02-02 20:59:12,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:12,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:12,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:12,860 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:12,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:12,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:12,880 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.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) 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 20:59:12,883 INFO L168 Benchmark]: Toolchain (without parser) took 2256.10 ms. Allocated memory was 401.1 MB in the beginning and 624.4 MB in the end (delta: 223.3 MB). Free memory was 359.1 MB in the beginning and 500.9 MB in the end (delta: -141.8 MB). Peak memory consumption was 81.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:12,884 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:12,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.35 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 348.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:12,885 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 401.1 MB. Free memory was 348.5 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:12,885 INFO L168 Benchmark]: RCFGBuilder took 160.65 ms. Allocated memory is still 401.1 MB. Free memory was 345.9 MB in the beginning and 328.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:12,885 INFO L168 Benchmark]: TraceAbstraction took 1916.35 ms. Allocated memory was 401.1 MB in the beginning and 624.4 MB in the end (delta: 223.3 MB). Free memory was 328.6 MB in the beginning and 500.9 MB in the end (delta: -172.2 MB). Peak memory consumption was 51.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:12,886 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 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.35 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 348.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 401.1 MB. Free memory was 348.5 MB in the beginning and 345.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.65 ms. Allocated memory is still 401.1 MB. Free memory was 345.9 MB in the beginning and 328.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1916.35 ms. Allocated memory was 401.1 MB in the beginning and 624.4 MB in the end (delta: 223.3 MB). Free memory was 328.6 MB in the beginning and 500.9 MB in the end (delta: -172.2 MB). Peak memory consumption was 51.1 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/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-59-12-896.csv Received shutdown request...