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/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:29:20,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:29:20,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:29:20,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:29:20,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:29:20,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:29:20,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:29:20,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:29:20,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:29:20,309 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:29:20,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:29:20,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:29:20,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:29:20,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:29:20,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:29:20,314 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:29:20,316 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:29:20,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:29:20,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:29:20,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:29:20,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:29:20,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:29:20,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:29:20,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:29:20,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:29:20,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:29:20,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:29:20,327 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:29:20,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:29:20,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:29:20,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:29:20,328 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:29:20,338 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:29:20,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:29:20,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:29:20,340 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:29:20,340 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:29:20,340 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:29:20,340 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:29:20,341 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:29:20,341 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:29:20,341 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:29:20,341 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:29:20,342 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:29:20,342 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:29:20,342 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:29:20,342 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:29:20,342 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:29:20,343 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:29:20,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:29:20,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:29:20,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:29:20,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:29:20,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:29:20,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:29:20,344 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:29:20,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:29:20,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:29:20,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:29:20,345 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:29:20,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:29:20,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:29:20,345 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:29:20,346 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:29:20,346 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:29:20,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:29:20,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:29:20,347 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:29:20,347 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:29:20,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:29:20,392 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:29:20,395 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:29:20,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:29:20,396 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:29:20,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-23 14:29:20,553 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:29:20,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:29:20,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:29:20,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:29:20,564 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:29:20,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a484b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20, skipping insertion in model container [2018-01-23 14:29:20,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,580 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:29:20,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:29:20,733 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:29:20,750 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:29:20,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20 WrapperNode [2018-01-23 14:29:20,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:29:20,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:29:20,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:29:20,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:29:20,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (1/1) ... [2018-01-23 14:29:20,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:29:20,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:29:20,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:29:20,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:29:20,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (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:29:20,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:29:20,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:29:20,844 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:29:20,845 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:29:20,846 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:29:20,846 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:29:20,846 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:29:20,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:29:20,846 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:29:21,175 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:29:21,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:29:21 BoogieIcfgContainer [2018-01-23 14:29:21,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:29:21,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:29:21,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:29:21,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:29:21,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:29:20" (1/3) ... [2018-01-23 14:29:21,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c22405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:29:21, skipping insertion in model container [2018-01-23 14:29:21,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:29:20" (2/3) ... [2018-01-23 14:29:21,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c22405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:29:21, skipping insertion in model container [2018-01-23 14:29:21,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:29:21" (3/3) ... [2018-01-23 14:29:21,185 INFO L105 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-01-23 14:29:21,194 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:29:21,202 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-23 14:29:21,246 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:29:21,247 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:29:21,247 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:29:21,247 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:29:21,247 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:29:21,247 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:29:21,247 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:29:21,247 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:29:21,248 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:29:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:29:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:29:21,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,268 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:29:21,268 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:29:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 192202, now seen corresponding path program 1 times [2018-01-23 14:29:21,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:29:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:29:21,367 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:29:21,375 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:29:21,381 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:29:21,381 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:29:21,381 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:29:21,381 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:29:21,381 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:29:21,382 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:29:21,382 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:29:21,382 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:29:21,382 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:29:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:29:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:29:21,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,385 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:21,385 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:29:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -40797007, now seen corresponding path program 1 times [2018-01-23 14:29:21,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:21,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:21,446 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:29:21,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:21,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:29:21,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:29:21,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:29:21,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:29:21,466 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-23 14:29:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:21,574 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-01-23 14:29:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:29:21,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-23 14:29:21,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:21,584 INFO L225 Difference]: With dead ends: 146 [2018-01-23 14:29:21,584 INFO L226 Difference]: Without dead ends: 75 [2018-01-23 14:29:21,587 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:29:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-23 14:29:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-23 14:29:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-23 14:29:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-01-23 14:29:21,621 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 16 [2018-01-23 14:29:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:21,622 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-01-23 14:29:21,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:29:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-01-23 14:29:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:29:21,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:21,623 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:29:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1434130336, now seen corresponding path program 1 times [2018-01-23 14:29:21,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:21,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:21,701 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:29:21,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:21,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:29:21,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:29:21,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:29:21,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:29:21,704 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 4 states. [2018-01-23 14:29:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:21,772 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-23 14:29:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:29:21,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-23 14:29:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:21,777 INFO L225 Difference]: With dead ends: 101 [2018-01-23 14:29:21,777 INFO L226 Difference]: Without dead ends: 96 [2018-01-23 14:29:21,778 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:29:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-23 14:29:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-23 14:29:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-23 14:29:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2018-01-23 14:29:21,786 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 19 [2018-01-23 14:29:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:21,787 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2018-01-23 14:29:21,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:29:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2018-01-23 14:29:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:29:21,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,788 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:29:21,788 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:29:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 327687223, now seen corresponding path program 1 times [2018-01-23 14:29:21,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:21,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:21,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:21,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:29:21,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:29:21,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:29:21,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:29:21,853 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 3 states. [2018-01-23 14:29:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:21,873 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-23 14:29:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:29:21,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-23 14:29:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:21,876 INFO L225 Difference]: With dead ends: 145 [2018-01-23 14:29:21,876 INFO L226 Difference]: Without dead ends: 98 [2018-01-23 14:29:21,877 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:29:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-23 14:29:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-23 14:29:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-23 14:29:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-01-23 14:29:21,885 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 28 [2018-01-23 14:29:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:21,885 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-01-23 14:29:21,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:29:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-01-23 14:29:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-23 14:29:21,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,886 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:29:21,886 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:29:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1119090828, now seen corresponding path program 1 times [2018-01-23 14:29:21,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:29:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:29:21,933 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:29:21,940 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:29:21,945 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:29:21,945 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:29:21,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:29:21,956 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:29:21,957 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:29:21,957 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:29:21,957 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:29:21,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:29:21,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:29:21,957 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:29:21,957 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:29:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-01-23 14:29:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:29:21,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,959 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:21,959 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -911773288, now seen corresponding path program 1 times [2018-01-23 14:29:21,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:21,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:21,978 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:29:21,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:21,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:29:21,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:29:21,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:29:21,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:29:21,980 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-01-23 14:29:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:21,987 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-01-23 14:29:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:29:21,987 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-23 14:29:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:21,988 INFO L225 Difference]: With dead ends: 146 [2018-01-23 14:29:21,989 INFO L226 Difference]: Without dead ends: 73 [2018-01-23 14:29:21,989 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:29:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-23 14:29:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-23 14:29:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-23 14:29:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-01-23 14:29:21,995 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 14 [2018-01-23 14:29:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:21,996 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-01-23 14:29:21,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:29:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-01-23 14:29:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-23 14:29:21,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:21,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:21,996 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 244317447, now seen corresponding path program 1 times [2018-01-23 14:29:21,997 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:21,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:21,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:21,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:21,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:22,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:22,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:22,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:29:22,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:29:22,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:29:22,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:29:22,038 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 4 states. [2018-01-23 14:29:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:22,063 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-01-23 14:29:22,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:29:22,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-23 14:29:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:22,065 INFO L225 Difference]: With dead ends: 97 [2018-01-23 14:29:22,065 INFO L226 Difference]: Without dead ends: 94 [2018-01-23 14:29:22,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:29:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-23 14:29:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-23 14:29:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-23 14:29:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-23 14:29:22,073 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 17 [2018-01-23 14:29:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:22,074 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-23 14:29:22,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:29:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-23 14:29:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:29:22,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:22,076 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] [2018-01-23 14:29:22,076 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -844350818, now seen corresponding path program 1 times [2018-01-23 14:29:22,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:22,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:22,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:22,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:22,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:22,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:22,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:29:22,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:29:22,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:29:22,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:29:22,109 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 3 states. [2018-01-23 14:29:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:22,125 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2018-01-23 14:29:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:29:22,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-23 14:29:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:22,127 INFO L225 Difference]: With dead ends: 141 [2018-01-23 14:29:22,127 INFO L226 Difference]: Without dead ends: 96 [2018-01-23 14:29:22,127 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:29:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-23 14:29:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-23 14:29:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-23 14:29:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2018-01-23 14:29:22,135 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 26 [2018-01-23 14:29:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:22,135 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2018-01-23 14:29:22,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:29:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2018-01-23 14:29:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-23 14:29:22,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:22,136 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:29:22,136 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash 217829659, now seen corresponding path program 1 times [2018-01-23 14:29:22,136 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:22,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:22,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:22,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:22,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:22,323 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:29:22,324 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:22,324 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:29:22,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:22,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:22,520 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~n~4.base Int)) (and (not (= 0 main_~n~4.base)) (= |c_#valid| (store |c_old(#valid)| main_~n~4.base 0)) (= 0 (select |c_old(#valid)| main_~n~4.base)))) is different from true [2018-01-23 14:29:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-23 14:29:22,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:22,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-23 14:29:22,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:29:22,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:29:22,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2018-01-23 14:29:22,555 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 10 states. [2018-01-23 14:29:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:23,176 INFO L93 Difference]: Finished difference Result 306 states and 376 transitions. [2018-01-23 14:29:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:29:23,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-23 14:29:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:23,180 INFO L225 Difference]: With dead ends: 306 [2018-01-23 14:29:23,181 INFO L226 Difference]: Without dead ends: 250 [2018-01-23 14:29:23,181 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=203, Unknown=1, NotChecked=30, Total=306 [2018-01-23 14:29:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-23 14:29:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 146. [2018-01-23 14:29:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-23 14:29:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2018-01-23 14:29:23,197 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 28 [2018-01-23 14:29:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:23,197 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2018-01-23 14:29:23,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:29:23,198 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2018-01-23 14:29:23,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:29:23,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:23,200 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-01-23 14:29:23,200 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:23,200 INFO L82 PathProgramCache]: Analyzing trace with hash -753850202, now seen corresponding path program 1 times [2018-01-23 14:29:23,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:23,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:23,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:23,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:23,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-23 14:29:23,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:23,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:29:23,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:29:23,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:29:23,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:29:23,358 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand 6 states. [2018-01-23 14:29:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:23,616 INFO L93 Difference]: Finished difference Result 285 states and 345 transitions. [2018-01-23 14:29:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:29:23,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-23 14:29:23,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:23,617 INFO L225 Difference]: With dead ends: 285 [2018-01-23 14:29:23,617 INFO L226 Difference]: Without dead ends: 238 [2018-01-23 14:29:23,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:29:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-23 14:29:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 172. [2018-01-23 14:29:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-23 14:29:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2018-01-23 14:29:23,630 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 37 [2018-01-23 14:29:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:23,630 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2018-01-23 14:29:23,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:29:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2018-01-23 14:29:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-23 14:29:23,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:23,632 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:23,632 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 612657287, now seen corresponding path program 2 times [2018-01-23 14:29:23,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:23,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:23,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:23,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:23,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:23,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:23,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:29:23,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:29:23,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:29:23,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:29:23,678 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 3 states. [2018-01-23 14:29:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:23,695 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2018-01-23 14:29:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:29:23,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-23 14:29:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:23,696 INFO L225 Difference]: With dead ends: 178 [2018-01-23 14:29:23,696 INFO L226 Difference]: Without dead ends: 150 [2018-01-23 14:29:23,696 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:29:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-23 14:29:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-23 14:29:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:29:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2018-01-23 14:29:23,707 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 39 [2018-01-23 14:29:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:23,707 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2018-01-23 14:29:23,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:29:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2018-01-23 14:29:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-23 14:29:23,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:23,709 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-01-23 14:29:23,709 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash 352686601, now seen corresponding path program 1 times [2018-01-23 14:29:23,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:23,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:23,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,711 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:29:23,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:23,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:23,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:29:23,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:29:23,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:29:23,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:29:23,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:29:23,799 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand 6 states. [2018-01-23 14:29:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:23,948 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2018-01-23 14:29:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:29:23,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-23 14:29:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:23,950 INFO L225 Difference]: With dead ends: 215 [2018-01-23 14:29:23,950 INFO L226 Difference]: Without dead ends: 161 [2018-01-23 14:29:23,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:29:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-23 14:29:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-01-23 14:29:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-23 14:29:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2018-01-23 14:29:23,960 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 39 [2018-01-23 14:29:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:23,961 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2018-01-23 14:29:23,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:29:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2018-01-23 14:29:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-23 14:29:23,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:23,962 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-01-23 14:29:23,962 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1976444667, now seen corresponding path program 1 times [2018-01-23 14:29:23,962 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:23,962 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:23,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:23,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:23,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:24,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:24,040 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:29:24,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:24,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:24,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:24,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-23 14:29:24,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:29:24,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:29:24,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:29:24,115 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand 8 states. [2018-01-23 14:29:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:24,322 INFO L93 Difference]: Finished difference Result 302 states and 359 transitions. [2018-01-23 14:29:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:29:24,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-23 14:29:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:24,324 INFO L225 Difference]: With dead ends: 302 [2018-01-23 14:29:24,324 INFO L226 Difference]: Without dead ends: 296 [2018-01-23 14:29:24,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:29:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-23 14:29:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 194. [2018-01-23 14:29:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-23 14:29:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 229 transitions. [2018-01-23 14:29:24,341 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 229 transitions. Word has length 39 [2018-01-23 14:29:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:24,341 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 229 transitions. [2018-01-23 14:29:24,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:29:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 229 transitions. [2018-01-23 14:29:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-23 14:29:24,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:24,342 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1] [2018-01-23 14:29:24,342 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:24,343 INFO L82 PathProgramCache]: Analyzing trace with hash 534013948, now seen corresponding path program 1 times [2018-01-23 14:29:24,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:24,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:24,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:24,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:24,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:24,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:24,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:24,469 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:29:24,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:24,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:24,566 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 25 [2018-01-23 14:29:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:29:24,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,584 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 14 treesize of output 12 [2018-01-23 14:29:24,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:29:24,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,593 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 27 [2018-01-23 14:29:24,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:29:24,594 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:29:24,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:29:24,604 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:24,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:24,607 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:59, output treesize:9 [2018-01-23 14:29:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:24,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:24,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-01-23 14:29:24,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:29:24,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:29:24,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:29:24,645 INFO L87 Difference]: Start difference. First operand 194 states and 229 transitions. Second operand 9 states. [2018-01-23 14:29:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:29:25,044 INFO L93 Difference]: Finished difference Result 310 states and 367 transitions. [2018-01-23 14:29:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:29:25,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-01-23 14:29:25,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:29:25,046 INFO L225 Difference]: With dead ends: 310 [2018-01-23 14:29:25,046 INFO L226 Difference]: Without dead ends: 304 [2018-01-23 14:29:25,047 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:29:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-23 14:29:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 225. [2018-01-23 14:29:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-23 14:29:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2018-01-23 14:29:25,060 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 48 [2018-01-23 14:29:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:29:25,060 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2018-01-23 14:29:25,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:29:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2018-01-23 14:29:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:29:25,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:29:25,061 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:29:25,061 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:29:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1054285108, now seen corresponding path program 1 times [2018-01-23 14:29:25,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:29:25,062 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:29:25,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:25,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:25,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:29:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:25,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:29:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:25,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:29:25,490 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:29:25,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:29:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:29:25,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:29:25,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:29:25,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:29:25,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:29:25,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:29:25,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-23 14:29:25,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:29:25,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-23 14:29:25,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,683 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:29:25,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-23 14:29:25,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2018-01-23 14:29:25,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-23 14:29:25,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:29:25,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-01-23 14:29:25,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-23 14:29:25,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-23 14:29:25,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:29:25,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:29:25,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-01-23 14:29:31,943 WARN L146 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-23 14:29:33,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-01-23 14:29:33,992 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 1 case distinctions, treesize of input 18 treesize of output 17 [2018-01-23 14:29:33,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:29:34,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:29:34,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:29:34,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:34,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:29:34,012 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-01-23 14:29:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:29:34,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:29:34,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-01-23 14:29:34,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-23 14:29:34,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-23 14:29:34,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=581, Unknown=3, NotChecked=0, Total=650 [2018-01-23 14:29:34,197 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 26 states. [2018-01-23 14:29:34,536 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 31 DAG size of output 23 [2018-01-23 14:30:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:30:19,802 INFO L93 Difference]: Finished difference Result 688 states and 831 transitions. [2018-01-23 14:30:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:30:19,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-01-23 14:30:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:30:19,805 INFO L225 Difference]: With dead ends: 688 [2018-01-23 14:30:19,805 INFO L226 Difference]: Without dead ends: 623 [2018-01-23 14:30:19,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=356, Invalid=1431, Unknown=19, NotChecked=0, Total=1806 [2018-01-23 14:30:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-01-23 14:30:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 296. [2018-01-23 14:30:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-23 14:30:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 357 transitions. [2018-01-23 14:30:19,825 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 357 transitions. Word has length 52 [2018-01-23 14:30:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:30:19,825 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 357 transitions. [2018-01-23 14:30:19,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-23 14:30:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 357 transitions. [2018-01-23 14:30:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:30:19,826 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:30:19,826 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:30:19,826 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:30:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1046354380, now seen corresponding path program 1 times [2018-01-23 14:30:19,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:30:19,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:30:19,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:19,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:19,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:30:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:19,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:30:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:20,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:30:20,262 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:30:20,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:30:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:30:20,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:30:20,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:30:20,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:30:20,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:20,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:30:20,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:30:20,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-23 14:30:20,374 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 13 treesize of output 10 [2018-01-23 14:30:20,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-01-23 14:30:20,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,383 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:30:20,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-23 14:30:20,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-01-23 14:30:20,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-23 14:30:20,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:20,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-01-23 14:30:20,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-23 14:30:20,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-23 14:30:20,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:30:20,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:30:20,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-01-23 14:30:26,516 WARN L146 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-23 14:30:28,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:30:28,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:30:28,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:30:28,599 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 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:30:28,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:30:28,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:28,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:30:28,608 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-01-23 14:30:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:30:28,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:30:28,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2018-01-23 14:30:28,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-23 14:30:28,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-23 14:30:28,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=483, Unknown=3, NotChecked=0, Total=552 [2018-01-23 14:30:28,684 INFO L87 Difference]: Start difference. First operand 296 states and 357 transitions. Second operand 24 states. Received shutdown request... [2018-01-23 14:30:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:30:35,094 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:30:35,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:30:35 BoogieIcfgContainer [2018-01-23 14:30:35,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:30:35,128 INFO L168 Benchmark]: Toolchain (without parser) took 74574.72 ms. Allocated memory was 306.2 MB in the beginning and 592.4 MB in the end (delta: 286.3 MB). Free memory was 265.1 MB in the beginning and 432.1 MB in the end (delta: -166.9 MB). Peak memory consumption was 119.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:30:35,129 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 306.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:30:35,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.29 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 253.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:30:35,129 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 251.1 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:30:35,130 INFO L168 Benchmark]: RCFGBuilder took 375.89 ms. Allocated memory is still 306.2 MB. Free memory was 251.1 MB in the beginning and 226.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:30:35,130 INFO L168 Benchmark]: TraceAbstraction took 73950.17 ms. Allocated memory was 306.2 MB in the beginning and 592.4 MB in the end (delta: 286.3 MB). Free memory was 226.1 MB in the beginning and 432.1 MB in the end (delta: -205.9 MB). Peak memory consumption was 80.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:30:35,131 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.13 ms. Allocated memory is still 306.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.29 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 253.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 375.89 ms. Allocated memory is still 306.2 MB. Free memory was 251.1 MB in the beginning and 226.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73950.17 ms. Allocated memory was 306.2 MB in the beginning and 592.4 MB in the end (delta: 286.3 MB). Free memory was 226.1 MB in the beginning and 432.1 MB in the end (delta: -205.9 MB). Peak memory consumption was 80.3 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, 78 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=78occurred 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: [L625] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={10:0}] [L625] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L626] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L627] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, root={10:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L647] n = ((void *)0) [L648] struct TreeNode* pred; VAL [malloc(sizeof(*root))={10:0}, n={0:0}, root={10:0}] [L649] COND TRUE \read(*root) [L650] pred = ((void *)0) [L651] n = root VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={10:0}] [L652] EXPR, FCALL n->left VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, pred={0:0}, root={10:0}] [L652] n->left || n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={10:0}] [L652] EXPR, FCALL n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={10:0}] [L652] n->left || n->right VAL [malloc(sizeof(*root))={10:0}, n={10:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={10:0}] [L652] COND FALSE !(n->left || n->right) [L659] COND FALSE !(\read(*pred)) [L665] root = ((void *)0) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L666] FCALL free(n) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L649] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={10:0}, n={10:0}, pred={0:0}, root={0:0}] [L668] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 173 SDslu, 123 SDs, 0 SdLazy, 14 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (296states) and interpolant automaton (currently 8 states, 24 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 29 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 78 locations, 3 error locations. TIMEOUT Result, 73.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 53.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 905 SDtfs, 3044 SDslu, 3632 SDs, 0 SdLazy, 2505 SolverSat, 188 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 205 SyntacticMatches, 11 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 51.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=10, 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: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 684 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 594 ConstructedInterpolants, 35 QuantifiedInterpolants, 203605 SizeOfPredicates, 53 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 67/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-30-35-140.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-30-35-140.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-30-35-140.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-30-35-140.csv Completed graceful shutdown