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/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:20:49,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:20:49,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:20:49,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:20:49,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:20:49,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:20:49,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:20:49,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:20:49,936 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:20:49,936 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:20:49,937 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:20:49,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:20:49,939 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:20:49,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:20:49,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:20:49,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:20:49,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:20:49,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:20:49,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:20:49,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:20:49,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:20:49,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:20:49,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:20:49,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:20:49,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:20:49,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:20:49,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:20:49,957 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:20:49,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:20:49,957 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:20:49,958 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:20:49,958 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:20:49,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:20:49,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:20:49,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:20:49,970 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:20:49,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:20:49,971 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:20:49,971 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:20:49,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:20:49,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:20:49,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:20:49,972 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:20:49,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:20:49,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:20:49,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:20:49,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:20:49,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:20:49,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:20:49,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:20:49,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:20:49,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:20:49,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:20:49,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:20:49,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:20:49,975 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:20:49,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:20:49,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:20:49,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:20:49,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:20:49,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:20:49,977 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:20:49,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:20:49,978 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:20:50,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:20:50,029 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:20:50,033 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:20:50,035 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:20:50,035 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:20:50,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/reverse_array_unsafe_false-valid-deref.i [2018-01-23 14:20:50,242 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:20:50,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:20:50,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:20:50,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:20:50,253 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:20:50,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3072b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50, skipping insertion in model container [2018-01-23 14:20:50,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,271 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:20:50,310 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:20:50,434 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:20:50,451 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:20:50,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50 WrapperNode [2018-01-23 14:20:50,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:20:50,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:20:50,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:20:50,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:20:50,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... [2018-01-23 14:20:50,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:20:50,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:20:50,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:20:50,488 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:20:50,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (1/1) ... No working directory specified, using /storage/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-01-23 14:20:50,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:20:50,535 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:20:50,535 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:20:50,535 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:20:50,536 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:20:50,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:20:50,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:20:50,751 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:20:50,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:20:50 BoogieIcfgContainer [2018-01-23 14:20:50,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:20:50,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:20:50,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:20:50,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:20:50,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:20:50" (1/3) ... [2018-01-23 14:20:50,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fef922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:20:50, skipping insertion in model container [2018-01-23 14:20:50,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:20:50" (2/3) ... [2018-01-23 14:20:50,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fef922c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:20:50, skipping insertion in model container [2018-01-23 14:20:50,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:20:50" (3/3) ... [2018-01-23 14:20:50,757 INFO L105 eAbstractionObserver]: Analyzing ICFG reverse_array_unsafe_false-valid-deref.i [2018-01-23 14:20:50,764 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:20:50,771 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:20:50,810 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:50,810 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:50,810 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:50,810 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:50,810 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:50,810 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:50,810 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:50,811 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:20:50,811 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:20:50,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:50,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:20:50,840 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:20:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash 109556, now seen corresponding path program 1 times [2018-01-23 14:20:50,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:50,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:50,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:50,944 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:20:50,950 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:50,957 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:50,958 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:50,958 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:50,958 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:50,958 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:50,958 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:50,958 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:50,959 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:20:50,959 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:20:50,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:50,962 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:50,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash 964801099, now seen corresponding path program 1 times [2018-01-23 14:20:50,962 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:50,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:50,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:50,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:50,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:51,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:51,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:20:51,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:20:51,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:20:51,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:51,054 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-23 14:20:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:51,155 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-23 14:20:51,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:20:51,157 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:20:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:51,168 INFO L225 Difference]: With dead ends: 70 [2018-01-23 14:20:51,168 INFO L226 Difference]: Without dead ends: 42 [2018-01-23 14:20:51,171 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-23 14:20:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-23 14:20:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-23 14:20:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-23 14:20:51,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-01-23 14:20:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:51,203 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-23 14:20:51,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:20:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-23 14:20:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:20:51,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:51,204 INFO L322 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] [2018-01-23 14:20:51,204 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:51,205 INFO L82 PathProgramCache]: Analyzing trace with hash -342950740, now seen corresponding path program 1 times [2018-01-23 14:20:51,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:51,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:51,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:51,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:51,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:51,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:51,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:51,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:20:51,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:20:51,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:20:51,377 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-01-23 14:20:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:51,414 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-23 14:20:51,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:20:51,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-23 14:20:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:51,418 INFO L225 Difference]: With dead ends: 109 [2018-01-23 14:20:51,418 INFO L226 Difference]: Without dead ends: 75 [2018-01-23 14:20:51,420 INFO L525 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-01-23 14:20:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-23 14:20:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-01-23 14:20:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:20:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-23 14:20:51,426 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 25 [2018-01-23 14:20:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:51,427 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-23 14:20:51,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:20:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-23 14:20:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:20:51,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:51,428 INFO L322 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] [2018-01-23 14:20:51,428 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1957871850, now seen corresponding path program 1 times [2018-01-23 14:20:51,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:51,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:51,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:51,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:51,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:51,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:51,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:20:51,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:51,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:51,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:51,519 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-23 14:20:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:51,577 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2018-01-23 14:20:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:20:51,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-23 14:20:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:51,579 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:20:51,579 INFO L226 Difference]: Without dead ends: 52 [2018-01-23 14:20:51,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-23 14:20:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-23 14:20:51,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-23 14:20:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-01-23 14:20:51,586 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 25 [2018-01-23 14:20:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:51,587 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-01-23 14:20:51,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-01-23 14:20:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:20:51,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:51,588 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:51,588 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:51,588 INFO L82 PathProgramCache]: Analyzing trace with hash -92922, now seen corresponding path program 1 times [2018-01-23 14:20:51,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:51,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:51,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:51,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:51,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:51,954 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 62 DAG size of output 25 [2018-01-23 14:20:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:52,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:52,394 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:20:52,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:52,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:52,537 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:20:52,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,572 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 27 treesize of output 22 [2018-01-23 14:20:52,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:52,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-23 14:20:52,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:20:52,621 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:26 [2018-01-23 14:20:52,709 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 30 treesize of output 24 [2018-01-23 14:20:52,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-23 14:20:52,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:52,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:4 [2018-01-23 14:20:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:52,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:52,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-01-23 14:20:52,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:20:52,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:20:52,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:20:52,813 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 18 states. [2018-01-23 14:20:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:53,487 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2018-01-23 14:20:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:20:53,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-01-23 14:20:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:53,489 INFO L225 Difference]: With dead ends: 102 [2018-01-23 14:20:53,489 INFO L226 Difference]: Without dead ends: 81 [2018-01-23 14:20:53,490 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:20:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-23 14:20:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-01-23 14:20:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:20:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-01-23 14:20:53,499 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 30 [2018-01-23 14:20:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:53,499 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-01-23 14:20:53,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:20:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-01-23 14:20:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:53,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:53,501 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:53,501 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:53,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2111018345, now seen corresponding path program 1 times [2018-01-23 14:20:53,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:53,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:53,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:53,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:53,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:53,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:20:53,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:53,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-23 14:20:53,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:20:53,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:20:53,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:20:53,688 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 11 states. [2018-01-23 14:20:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:53,916 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-01-23 14:20:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:20:53,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-01-23 14:20:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:53,918 INFO L225 Difference]: With dead ends: 128 [2018-01-23 14:20:53,918 INFO L226 Difference]: Without dead ends: 121 [2018-01-23 14:20:53,918 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:20:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-23 14:20:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2018-01-23 14:20:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-23 14:20:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-01-23 14:20:53,926 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2018-01-23 14:20:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:53,927 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-01-23 14:20:53,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:20:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-01-23 14:20:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:53,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:53,928 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:53,928 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2032509349, now seen corresponding path program 1 times [2018-01-23 14:20:53,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:53,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:53,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:53,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:53,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:53,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:53,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:53,988 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:20:53,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:54,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:54,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:54,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-23 14:20:54,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:20:54,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:20:54,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:20:54,074 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 8 states. [2018-01-23 14:20:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:54,174 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2018-01-23 14:20:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:20:54,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-23 14:20:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:54,176 INFO L225 Difference]: With dead ends: 185 [2018-01-23 14:20:54,176 INFO L226 Difference]: Without dead ends: 156 [2018-01-23 14:20:54,177 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:20:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-23 14:20:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2018-01-23 14:20:54,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-23 14:20:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-23 14:20:54,189 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2018-01-23 14:20:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:54,189 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-23 14:20:54,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:20:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-23 14:20:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-23 14:20:54,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:54,191 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:54,191 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2121909337, now seen corresponding path program 1 times [2018-01-23 14:20:54,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:54,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:54,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:54,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:54,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:54,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:54,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:54,383 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-23 14:20:54,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:54,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:54,485 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:20:54,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,508 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 27 treesize of output 22 [2018-01-23 14:20:54,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:54,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-23 14:20:54,513 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:32 [2018-01-23 14:20:54,581 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 33 treesize of output 27 [2018-01-23 14:20:54,583 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:20:54,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-01-23 14:20:54,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:54,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:4 [2018-01-23 14:20:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:54,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:54,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-01-23 14:20:54,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-23 14:20:54,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-23 14:20:54,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:20:54,620 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 19 states. [2018-01-23 14:20:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:55,388 INFO L93 Difference]: Finished difference Result 234 states and 263 transitions. [2018-01-23 14:20:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:20:55,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-23 14:20:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:55,389 INFO L225 Difference]: With dead ends: 234 [2018-01-23 14:20:55,389 INFO L226 Difference]: Without dead ends: 227 [2018-01-23 14:20:55,390 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2018-01-23 14:20:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-01-23 14:20:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 117. [2018-01-23 14:20:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-23 14:20:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-23 14:20:55,406 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 32 [2018-01-23 14:20:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:55,406 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-23 14:20:55,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-23 14:20:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-23 14:20:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-23 14:20:55,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:55,408 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:55,408 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1617625150, now seen corresponding path program 1 times [2018-01-23 14:20:55,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:55,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:55,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:55,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:55,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:55,732 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 63 DAG size of output 25 [2018-01-23 14:20:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:56,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:56,255 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:56,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:56,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:56,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-23 14:20:56,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-23 14:20:56,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-01-23 14:20:56,455 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 34 treesize of output 29 [2018-01-23 14:20:56,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-23 14:20:56,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,471 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 33 treesize of output 28 [2018-01-23 14:20:56,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-01-23 14:20:56,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:20:56,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:25 [2018-01-23 14:20:56,555 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 29 treesize of output 23 [2018-01-23 14:20:56,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:20:56,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-23 14:20:56,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:20:56,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2018-01-23 14:20:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:56,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:56,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 25 [2018-01-23 14:20:56,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-23 14:20:56,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-23 14:20:56,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-01-23 14:20:56,609 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 25 states. [2018-01-23 14:20:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:57,595 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2018-01-23 14:20:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:20:57,596 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-01-23 14:20:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:57,597 INFO L225 Difference]: With dead ends: 214 [2018-01-23 14:20:57,597 INFO L226 Difference]: Without dead ends: 193 [2018-01-23 14:20:57,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-01-23 14:20:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-23 14:20:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 117. [2018-01-23 14:20:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-23 14:20:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-01-23 14:20:57,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 34 [2018-01-23 14:20:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:57,619 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-01-23 14:20:57,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-23 14:20:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-01-23 14:20:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:20:57,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:57,620 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:57,620 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1234541807, now seen corresponding path program 2 times [2018-01-23 14:20:57,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:57,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:57,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:57,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:57,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:57,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:57,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:57,687 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:57,691 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:20:57,702 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:57,705 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:57,707 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:20:57,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:57,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:57,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-01-23 14:20:57,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:20:57,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:20:57,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:20:57,797 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 11 states. [2018-01-23 14:20:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:57,886 INFO L93 Difference]: Finished difference Result 209 states and 237 transitions. [2018-01-23 14:20:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:20:57,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-01-23 14:20:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:57,888 INFO L225 Difference]: With dead ends: 209 [2018-01-23 14:20:57,889 INFO L226 Difference]: Without dead ends: 180 [2018-01-23 14:20:57,889 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:20:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-23 14:20:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2018-01-23 14:20:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-23 14:20:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2018-01-23 14:20:57,903 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 37 [2018-01-23 14:20:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:57,903 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2018-01-23 14:20:57,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:20:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2018-01-23 14:20:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:20:57,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:57,905 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:57,905 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:57,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1211909553, now seen corresponding path program 2 times [2018-01-23 14:20:57,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:57,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:57,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:57,906 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:20:57,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:57,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:58,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:20:58,109 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:20:58,117 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:20:58,125 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:58,128 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:20:58,129 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:20:58,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:20:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:58,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:20:58,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-23 14:20:58,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-23 14:20:58,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-23 14:20:58,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:20:58,216 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 13 states. [2018-01-23 14:20:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:58,327 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2018-01-23 14:20:58,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:20:58,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-01-23 14:20:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:58,329 INFO L225 Difference]: With dead ends: 248 [2018-01-23 14:20:58,329 INFO L226 Difference]: Without dead ends: 204 [2018-01-23 14:20:58,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:20:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-23 14:20:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 144. [2018-01-23 14:20:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-23 14:20:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2018-01-23 14:20:58,346 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 37 [2018-01-23 14:20:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:58,346 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2018-01-23 14:20:58,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-23 14:20:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2018-01-23 14:20:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:20:58,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:58,347 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:58,347 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:20:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 859940133, now seen corresponding path program 3 times [2018-01-23 14:20:58,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:58,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:58,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,349 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:20:58,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:20:58,380 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:20:58,386 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:58,393 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:58,393 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:20:58,407 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:20:58,407 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:20:58,408 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:20:58,408 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:20:58,408 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:20:58,408 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:20:58,408 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:20:58,408 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:20:58,408 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:20:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-23 14:20:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:20:58,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:58,410 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:58,410 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash -168828260, now seen corresponding path program 1 times [2018-01-23 14:20:58,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:58,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:58,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:58,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:58,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:58,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:58,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:20:58,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:20:58,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:20:58,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:58,422 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-01-23 14:20:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:58,424 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-01-23 14:20:58,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:20:58,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:20:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:58,425 INFO L225 Difference]: With dead ends: 70 [2018-01-23 14:20:58,425 INFO L226 Difference]: Without dead ends: 40 [2018-01-23 14:20:58,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:20:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-23 14:20:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-23 14:20:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-23 14:20:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-01-23 14:20:58,428 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 18 [2018-01-23 14:20:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:58,428 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-01-23 14:20:58,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:20:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-01-23 14:20:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:20:58,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:58,429 INFO L322 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-01-23 14:20:58,429 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash -371306179, now seen corresponding path program 1 times [2018-01-23 14:20:58,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:58,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:58,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:58,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:58,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:58,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:58,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:58,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:20:58,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:20:58,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:20:58,510 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-01-23 14:20:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:58,538 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-23 14:20:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:20:58,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-23 14:20:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:58,539 INFO L225 Difference]: With dead ends: 105 [2018-01-23 14:20:58,539 INFO L226 Difference]: Without dead ends: 73 [2018-01-23 14:20:58,540 INFO L525 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-01-23 14:20:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-23 14:20:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2018-01-23 14:20:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-23 14:20:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-23 14:20:58,543 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 23 [2018-01-23 14:20:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:58,543 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-23 14:20:58,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:20:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-23 14:20:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:20:58,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:58,544 INFO L322 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-01-23 14:20:58,544 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:58,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1392374533, now seen corresponding path program 1 times [2018-01-23 14:20:58,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:58,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:58,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:58,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:58,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:20:58,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:58,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:20:58,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:58,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:58,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:58,579 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 4 states. [2018-01-23 14:20:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:58,615 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-23 14:20:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:20:58,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-23 14:20:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:58,616 INFO L225 Difference]: With dead ends: 71 [2018-01-23 14:20:58,616 INFO L226 Difference]: Without dead ends: 50 [2018-01-23 14:20:58,616 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-23 14:20:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-23 14:20:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:20:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-23 14:20:58,618 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 23 [2018-01-23 14:20:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:58,618 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-23 14:20:58,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-23 14:20:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:20:58,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:20:58,619 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:20:58,619 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:20:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -634636265, now seen corresponding path program 1 times [2018-01-23 14:20:58,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:20:58,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:20:58,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:20:58,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:20:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:20:58,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:20:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:20:58,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:20:58,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:20:58,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:20:58,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:20:58,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:20:58,666 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-23 14:20:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:20:58,697 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-01-23 14:20:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:20:58,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-23 14:20:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:20:58,698 INFO L225 Difference]: With dead ends: 43 [2018-01-23 14:20:58,698 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:20:58,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-01-23 14:20:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:20:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:20:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:20:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:20:58,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-23 14:20:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:20:58,699 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:20:58,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:20:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:20:58,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:20:58,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:20:58 BoogieIcfgContainer [2018-01-23 14:20:58,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:20:58,703 INFO L168 Benchmark]: Toolchain (without parser) took 8460.77 ms. Allocated memory was 302.0 MB in the beginning and 564.7 MB in the end (delta: 262.7 MB). Free memory was 260.9 MB in the beginning and 338.0 MB in the end (delta: -77.1 MB). Peak memory consumption was 185.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:58,704 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:20:58,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.68 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:58,705 INFO L168 Benchmark]: Boogie Preprocessor took 28.48 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:58,705 INFO L168 Benchmark]: RCFGBuilder took 263.90 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 232.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:58,705 INFO L168 Benchmark]: TraceAbstraction took 7950.22 ms. Allocated memory was 302.0 MB in the beginning and 564.7 MB in the end (delta: 262.7 MB). Free memory was 232.0 MB in the beginning and 338.0 MB in the end (delta: -106.0 MB). Peak memory consumption was 156.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:20:58,707 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.68 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.48 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.90 ms. Allocated memory is still 302.0 MB. Free memory was 249.0 MB in the beginning and 232.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7950.22 ms. Allocated memory was 302.0 MB in the beginning and 564.7 MB in the end (delta: 262.7 MB). Free memory was 232.0 MB in the beginning and 338.0 MB in the end (delta: -106.0 MB). Peak memory consumption was 156.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 45 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L541] int i, j, tmp; [L542] int length = __VERIFIER_nondet_int(); [L543] COND FALSE !(length < 1) VAL [length=2] [L544] COND TRUE length % 2 == 0 [L544] length++ VAL [length=3] [L545] EXPR, FCALL __builtin_alloca (length) VAL [__builtin_alloca (length)={9:0}, length=3] [L545] int *arr = __builtin_alloca (length); [L546] i=0 VAL [__builtin_alloca (length)={9:0}, arr={9:0}, i=0, length=3] [L546] COND TRUE i