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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:54:23,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:54:23,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:54:23,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:54:23,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:54:23,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:54:23,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:54:23,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:54:23,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:54:23,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:54:23,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:54:23,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:54:23,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:54:23,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:54:23,430 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:54:23,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:54:23,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:54:23,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:54:23,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:54:23,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:54:23,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:54:23,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:54:23,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:54:23,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:54:23,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:54:23,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:54:23,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:54:23,441 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:54:23,441 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:54:23,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:54:23,442 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:54:23,442 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:54:23,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:54:23,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:54:23,452 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:54:23,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:54:23,452 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:54:23,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:54:23,453 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:54:23,454 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:54:23,454 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:54:23,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:54:23,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:54:23,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:54:23,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:54:23,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:54:23,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:54:23,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:54:23,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:54:23,455 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:54:23,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:54:23,456 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:54:23,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:54:23,491 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:54:23,493 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:54:23,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:54:23,494 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:54:23,495 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-03 22:54:23,613 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:54:23,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:54:23,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:23,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:54:23,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:54:23,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bada75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23, skipping insertion in model container [2018-02-03 22:54:23,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,639 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:23,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:23,751 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:23,762 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:23,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23 WrapperNode [2018-02-03 22:54:23,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:23,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:54:23,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:54:23,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:54:23,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (1/1) ... [2018-02-03 22:54:23,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:54:23,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:54:23,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:54:23,794 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:54:23,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (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-03 22:54:23,828 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:54:23,828 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:54:23,828 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-03 22:54:23,829 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:54:23,829 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:54:23,930 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:54:23,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:23 BoogieIcfgContainer [2018-02-03 22:54:23,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:54:23,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:54:23,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:54:23,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:54:23,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:54:23" (1/3) ... [2018-02-03 22:54:23,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:54:23, skipping insertion in model container [2018-02-03 22:54:23,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:23" (2/3) ... [2018-02-03 22:54:23,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:54:23, skipping insertion in model container [2018-02-03 22:54:23,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:23" (3/3) ... [2018-02-03 22:54:23,935 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:54:23,939 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:54:23,943 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-03 22:54:23,964 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:54:23,964 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:54:23,964 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:54:23,964 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:54:23,964 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:54:23,964 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:54:23,964 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:54:23,964 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:54:23,965 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:54:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-03 22:54:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 22:54:23,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:23,981 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:23,981 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-03 22:54:23,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:23,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,121 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-03 22:54:24,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:24,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:24,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:54:24,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:54:24,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:54:24,132 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-03 22:54:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:24,198 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-03 22:54:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:54:24,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-03 22:54:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:24,204 INFO L225 Difference]: With dead ends: 33 [2018-02-03 22:54:24,205 INFO L226 Difference]: Without dead ends: 30 [2018-02-03 22:54:24,205 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-03 22:54:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-03 22:54:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-03 22:54:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-03 22:54:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-03 22:54:24,260 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-03 22:54:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:24,260 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-03 22:54:24,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:54:24,260 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-03 22:54:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 22:54:24,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:24,261 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:24,261 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-03 22:54:24,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:24,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,262 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,262 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,350 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-03 22:54:24,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:24,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:54:24,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:54:24,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:54:24,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:54:24,352 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-03 22:54:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:24,375 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-03 22:54:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:54:24,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-03 22:54:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:24,376 INFO L225 Difference]: With dead ends: 29 [2018-02-03 22:54:24,376 INFO L226 Difference]: Without dead ends: 29 [2018-02-03 22:54:24,377 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-03 22:54:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-03 22:54:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-03 22:54:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-03 22:54:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-03 22:54:24,380 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-03 22:54:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:24,380 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-03 22:54:24,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:54:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-03 22:54:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:54:24,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:24,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:24,381 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:24,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-03 22:54:24,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:24,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,383 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,428 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-03 22:54:24,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:24,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:54:24,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:54:24,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:54:24,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:54:24,429 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-03 22:54:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:24,457 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-03 22:54:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:54:24,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-03 22:54:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:24,458 INFO L225 Difference]: With dead ends: 28 [2018-02-03 22:54:24,458 INFO L226 Difference]: Without dead ends: 28 [2018-02-03 22:54:24,458 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-03 22:54:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-03 22:54:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-03 22:54:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-03 22:54:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-03 22:54:24,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-03 22:54:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:24,460 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-03 22:54:24,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:54:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-03 22:54:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:54:24,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:24,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:24,460 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:24,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-03 22:54:24,461 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:24,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,544 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-03 22:54:24,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:24,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:54:24,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:54:24,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:54:24,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:54:24,545 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-03 22:54:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:24,624 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-03 22:54:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:54:24,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-03 22:54:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:24,627 INFO L225 Difference]: With dead ends: 37 [2018-02-03 22:54:24,627 INFO L226 Difference]: Without dead ends: 37 [2018-02-03 22:54:24,628 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-03 22:54:24,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-03 22:54:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-03 22:54:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-03 22:54:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-03 22:54:24,631 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-03 22:54:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:24,631 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-03 22:54:24,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:54:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-03 22:54:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:54:24,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:24,632 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-03 22:54:24,632 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-03 22:54:24,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:24,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,658 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-03 22:54:24,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:24,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:24,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:54:24,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:54:24,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:54:24,660 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-03 22:54:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:24,667 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-03 22:54:24,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:54:24,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-03 22:54:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:24,668 INFO L225 Difference]: With dead ends: 32 [2018-02-03 22:54:24,668 INFO L226 Difference]: Without dead ends: 32 [2018-02-03 22:54:24,668 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-03 22:54:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-03 22:54:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-03 22:54:24,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-03 22:54:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-03 22:54:24,671 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-03 22:54:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:24,671 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-03 22:54:24,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:54:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-03 22:54:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:54:24,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:24,672 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-03 22:54:24,672 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-03 22:54:24,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:24,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:24,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:24,746 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-03 22:54:24,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:24,746 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:24,752 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:24,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:24,811 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 11 treesize of output 8 [2018-02-03 22:54:24,813 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 8 treesize of output 7 [2018-02-03 22:54:24,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-03 22:54:24,840 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 15 treesize of output 11 [2018-02-03 22:54:24,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-02-03 22:54:24,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:24,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-03 22:54:24,852 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-03 22:54:24,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:54:24,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 12 [2018-02-03 22:54:24,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:54:24,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:54:24,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:54:24,869 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2018-02-03 22:54:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:25,218 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-02-03 22:54:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 22:54:25,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-03 22:54:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:25,220 INFO L225 Difference]: With dead ends: 97 [2018-02-03 22:54:25,220 INFO L226 Difference]: Without dead ends: 97 [2018-02-03 22:54:25,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:54:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-03 22:54:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2018-02-03 22:54:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-03 22:54:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-03 22:54:25,231 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-03 22:54:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:25,231 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-03 22:54:25,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:54:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-03 22:54:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:54:25,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:25,232 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-03 22:54:25,232 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:25,232 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-03 22:54:25,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:25,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:25,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:25,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:25,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:25,377 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-03 22:54:25,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:25,377 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:25,383 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:25,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:25,404 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 14 treesize of output 11 [2018-02-03 22:54:25,405 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 11 treesize of output 10 [2018-02-03 22:54:25,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:25,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:25,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:25,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:54:25,478 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 18 treesize of output 14 [2018-02-03 22:54:25,486 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 14 treesize of output 11 [2018-02-03 22:54:25,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:25,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:25,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:25,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-02-03 22:54:25,595 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-03 22:54:25,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:25,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-02-03 22:54:25,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 22:54:25,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 22:54:25,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-03 22:54:25,612 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 18 states. [2018-02-03 22:54:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:26,181 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-03 22:54:26,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:54:26,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-02-03 22:54:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:26,183 INFO L225 Difference]: With dead ends: 85 [2018-02-03 22:54:26,183 INFO L226 Difference]: Without dead ends: 85 [2018-02-03 22:54:26,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-02-03 22:54:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-03 22:54:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-03 22:54:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-03 22:54:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-03 22:54:26,187 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-03 22:54:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:26,188 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-03 22:54:26,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 22:54:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-03 22:54:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:54:26,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:26,188 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-03 22:54:26,188 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-03 22:54:26,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:26,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:26,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:26,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:26,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:26,268 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-03 22:54:26,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:26,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:54:26,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:54:26,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:54:26,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:54:26,269 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-03 22:54:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:26,327 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-03 22:54:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:54:26,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-03 22:54:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:26,329 INFO L225 Difference]: With dead ends: 96 [2018-02-03 22:54:26,329 INFO L226 Difference]: Without dead ends: 92 [2018-02-03 22:54:26,329 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-03 22:54:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-03 22:54:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-03 22:54:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-03 22:54:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-03 22:54:26,339 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-03 22:54:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:26,339 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-03 22:54:26,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:54:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-03 22:54:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:54:26,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:26,341 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-03 22:54:26,341 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:26,341 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-03 22:54:26,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:26,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:26,341 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,341 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:26,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:26,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:26,393 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-03 22:54:26,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:26,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:26,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:54:26,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:54:26,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:54:26,395 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-02-03 22:54:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:26,433 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-03 22:54:26,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:54:26,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-03 22:54:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:26,434 INFO L225 Difference]: With dead ends: 76 [2018-02-03 22:54:26,434 INFO L226 Difference]: Without dead ends: 29 [2018-02-03 22:54:26,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:54:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-03 22:54:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-03 22:54:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-03 22:54:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-03 22:54:26,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-02-03 22:54:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:26,437 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-03 22:54:26,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:54:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-03 22:54:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:54:26,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:26,438 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:26,438 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:54:26,439 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 2 times [2018-02-03 22:54:26,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:26,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:26,439 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,440 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:26,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:26,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:26,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:26,666 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:26,671 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:26,692 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:26,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:26,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:26,697 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-03 22:54:26,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:26,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:26,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:54:26,722 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-03 22:54:26,723 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-03 22:54:26,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:26,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:26,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:26,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-03 22:54:26,830 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-03 22:54:26,835 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-03 22:54:26,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:26,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:26,844 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-03 22:54:26,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-02-03 22:54:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:26,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:26,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-03 22:54:26,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 22:54:26,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 22:54:26,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-03 22:54:26,930 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 20 states. [2018-02-03 22:54:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:27,377 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-03 22:54:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:54:27,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-02-03 22:54:27,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:27,378 INFO L225 Difference]: With dead ends: 31 [2018-02-03 22:54:27,378 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:54:27,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2018-02-03 22:54:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:54:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:54:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:54:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:54:27,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-03 22:54:27,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:27,379 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:54:27,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 22:54:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:54:27,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:54:27,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:54:27 BoogieIcfgContainer [2018-02-03 22:54:27,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:54:27,382 INFO L168 Benchmark]: Toolchain (without parser) took 3768.81 ms. Allocated memory was 392.7 MB in the beginning and 666.4 MB in the end (delta: 273.7 MB). Free memory was 349.6 MB in the beginning and 624.3 MB in the end (delta: -274.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:54:27,383 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 392.7 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:54:27,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.22 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 338.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:27,383 INFO L168 Benchmark]: Boogie Preprocessor took 26.53 ms. Allocated memory is still 392.7 MB. Free memory was 338.9 MB in the beginning and 337.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:27,384 INFO L168 Benchmark]: RCFGBuilder took 136.41 ms. Allocated memory is still 392.7 MB. Free memory was 337.6 MB in the beginning and 322.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:27,384 INFO L168 Benchmark]: TraceAbstraction took 3450.87 ms. Allocated memory was 392.7 MB in the beginning and 666.4 MB in the end (delta: 273.7 MB). Free memory was 321.0 MB in the beginning and 624.3 MB in the end (delta: -303.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:54:27,384 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.15 ms. Allocated memory is still 392.7 MB. Free memory is still 356.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.22 ms. Allocated memory is still 392.7 MB. Free memory was 349.6 MB in the beginning and 338.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.53 ms. Allocated memory is still 392.7 MB. Free memory was 338.9 MB in the beginning and 337.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 136.41 ms. Allocated memory is still 392.7 MB. Free memory was 337.6 MB in the beginning and 322.3 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3450.87 ms. Allocated memory was 392.7 MB in the beginning and 666.4 MB in the end (delta: 273.7 MB). Free memory was 321.0 MB in the beginning and 624.3 MB in the end (delta: -303.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 3.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 356 SDslu, 923 SDs, 0 SdLazy, 746 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 15 QuantifiedInterpolants, 39127 SizeOfPredicates, 25 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 9/38 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-54-27-389.csv 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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-54-27-389.csv Received shutdown request...